Home
Digital Library
Site Map
Store
Contact Us
Press Room
Shopping Cart
Help
Login
Simple Search
Advanced Search
Author Search
Proceedings Search
CS Store Search
Google Search
Search Help
Search For:
Displaying 1-23 out of 23 total
Improving Software Investments through Requirements Validation
Found in:
Software Engineering Workshop, Annual IEEE/NASA Goddard
By David Cohen, Gary Larson, Bill Ware
Issue Date:November 2001
pp. 106
<p>IT organizations are increasingly being expected to provide business-solutions faster and with better return on investments (ROIs). The limited technology focus of IT organizations on software fails to deliver predictable, relevant and cost effect...
Interpersonal Synchrony: A Survey of Evaluation Methods across Disciplines
Found in:
IEEE Transactions on Affective Computing
By Emilie Delaherche,Mohamed Chetouani,Ammar Mahdhaoui,Catherine Saint-Georges,Sylvie Viaux,David Cohen
Issue Date:July 2012
pp. 349-365
Synchrony refers to individuals' temporal coordination during social interactions. The analysis of this phenomenon is complex, requiring the perception and integration of multimodal communicative signals. The evaluation of synchrony has received multidisci...
Remote Direct Memory Access over the Converged Enhanced Ethernet Fabric: Evaluating the Options
Found in:
High-Performance Interconnects, Symposium on
By David Cohen, Thomas Talpey, Arkady Kanevsky, Uri Cummings, Michael Krause, Renato Recio, Diego Crupnicoff, Lloyd Dickman, Paul Grun
Issue Date:August 2009
pp. 123-130
Remote Direct Memory Access (RDMA)-based communication has enjoyed considerable growth since the introduction of the Virtual Interface Architecture (VIA) in the late 1990s. This growth has accelerated since the introduction of the Open Fabric Alliance’s (O...
Inferring Local Homology from Sampled Stratified Spaces
Found in:
Foundations of Computer Science, Annual IEEE Symposium on
By Paul Bendich, David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov
Issue Date:October 2007
pp. 536-546
We study the reconstruction of a stratified space from a possibly noisy point sample. Specifically, we use the vineyard of the distance function restricted to a 1-parameter family of neighborhoods of a point to assess the local homology of the stratified s...
Modeling Data Centers as Economic Markets for Dynamic Service Provisioning and Resource Management
Found in:
Virtualization Technology in Distributed Computing, International Workshop on
By David Cohen, Stuart Schaefer
Issue Date:November 2006
pp. 10
Within the computing industry the recent shift in emphasis to Service-Orientation gives rise to the question: how does delivering computation as a service differ from the way we deliver it today? Simultaneously, there has been a corresponding shift to scal...
A Web Based Wireless Order Management Application
Found in:
Computer Networks and Mobile Computing, International Conference on
By David Cohen, Gary Larson, Bill Ware
Issue Date:October 2001
pp. 27
The Wireless Industry finds itself under significant economic pressure on both margins and revenue. competition and recent 3G network investments demand new revenues streams. This further increases the pressure on network operators to deploy faster and mor...
Extending Life Cycle of Legacy Systems
Found in:
Computer Networks and Mobile Computing, International Conference on
By David Cohen, Gary Larson, Doug McDougal, Bill Ware
Issue Date:October 2003
pp. 291
IT organizations have consistently failed to re-engineer legacy systems applications over the last two decades. The legacy applications continue to be vital to the business operations of most large corporations. The ability of the IT organization to effect...
Computing geometry-aware handle and tunnel loops in 3D models
Found in: ACM Transactions on Graphics (TOG)
By David Cohen-Steiner, Jian Sun, Kuiyu Li, Tamal K. Dey
Issue Date:August 2008
pp. 1-49
Many applications such as topology repair, model editing, surface parameterization, and feature recognition benefit from computing loops on surfaces that wrap around their 'handles' and 'tunnels'. Computing such loops while optimizing their geometric lengt...
A sampling theory for compact sets in Euclidean space
Found in: Proceedings of the twenty-second annual symposium on Computational geometry (SCG '06)
By Andre Lieutier, David Cohen-Steiner, Frederic Chazal
Issue Date:June 2006
pp. 319-326
We introduce a parameterized notion of feature size that interpolates between the minimum of the local feature size, and the recently introduced weak feature size. Based on this notion of feature size, we propose sampling conditions that apply to noisy sam...
Vines and vineyards by updating persistence in linear time
Found in: Proceedings of the twenty-second annual symposium on Computational geometry (SCG '06)
By David Cohen-Steiner, Dmitriy Morozov, Herbert Edelsbrunner
Issue Date:June 2006
pp. 119-126
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing of the critical values of a function, visualized by points forming a diagram i...
Variational tetrahedral meshing
Found in: ACM SIGGRAPH 2005 Courses (SIGGRAPH '05)
By David Cohen-Steiner, Mariette Yvinec, Mathieu Desbrun, Pierre Alliez
Issue Date:July 2005
pp. 10-es
In this chapter, a novel Delaunay-based variational approach to isotropic tetrahedral meshing is presented. To achieve both robustness and efficiency, we minimize a simple mesh-dependent energy through global updates of both vertex positions and connectivi...
Inequalities for the curvature of curves and surfaces
Found in: Proceedings of the twenty-first annual symposium on Computational geometry (SCG '05)
By David Cohen-Steiner, Herbert Edelsbrunner
Issue Date:June 2005
pp. 272-277
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fréchet distance between the volumes they enclose. The proof relies on a combination of methods f...
Stability of persistence diagrams
Found in: Proceedings of the twenty-first annual symposium on Computational geometry (SCG '05)
By David Cohen-Steiner, Herbert Edelsbrunner, John Harer
Issue Date:June 2005
pp. 263-271
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the persistence diagram is stable: small changes in the function imply only small ...
Variational shape approximation
Found in:
ACM Transactions on Graphics (TOG)
By David Cohen-Steiner, Mathieu Desbrun, Pierre Alliez
Issue Date:August 2004
pp. 905-914
A method for concise, faithful approximation of complex 3D datasets is key to reducing the computational cost of graphics applications. Despite numerous applications ranging from geometry compression to reverse engineering, efficiently capturing the geomet...
Isotopic implicit surface meshing
Found in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (STOC '04)
By David Cohen-Steiner, Gert Vegter, Jean-Daniel Boissonnat
Issue Date:June 2004
pp. 301-309
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a piecewise linear approximation of it are isotopic. Then, we deduce from this...
Anisotropic polygonal remeshing
Found in: ACM SIGGRAPH 2003 Papers (SIGGRAPH '03)
By Bruno Levy, David Cohen-Steiner, Mathieu Desbrun, Olivier Devillers, Pierre Alliez
Issue Date:July 2003
pp. 56-ff
In this paper, we propose a novel polygonal remeshing technique that exploits a key aspect of surfaces: the intrinsic anisotropy of natural or man-made geometry. In particular, we use curvature directions to drive the remeshing process, mimicking the lines...
Restricted delaunay triangulations and normal cycle
Found in:
Proceedings of the nineteenth conference on Computational geometry (SCG '03)
By David Cohen-Steiner, Jean-Marie Morvan
Issue Date:June 2003
pp. 312-321
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhedral surfaces. This definition consists in a very simple and new formula. When ...
Conforming Delaunay triangulations in 3D
Found in:
Proceedings of the eighteenth annual symposium on Computational geometry (SCG '02)
By Eric Colin de Verdiere, David Cohen-Steiner, Mariette Yvinec
Issue Date:June 2002
pp. 199-208
We describe an algorithm which, for any piecewise linear complex (PLC) in 3D, builds a Delaunay triangulation conforming to this PLC.The algorithm has been implemented, and yields in practice a relatively small number of Steiner points due to the fact that...
Role of interoperability in business application development
Found in:
Proceedings of the 1993 ACM SIGMOD international conference on Management of data (SIGMOD '93)
By David Cohen, Gary Larson, Larry Berke
Issue Date:May 1993
pp. 300-311
In this paper we address the problem of data consistency between interrelated data. In industrial environments, lack of consistent data creates difficulties in interoperation between systems and often requires manual interventions to restart operations tha...
Building tractable disjunctive constraints
Found in:
Journal of the ACM (JACM)
By David Cohen, Manolis Koubarakis, Peter Jeavons, Peter Jonsson
Issue Date:January 1988
pp. 826-853
Many combinatorial search problems can be expressed as 'constraint satisfaction problems'. This class of problems is known to be NP-hard in general, but a number of restricted constraint classes have been identified which ensure tractability. This paper pr...
Closure properties of constraints
Found in:
Journal of the ACM (JACM)
By David Cohen, Marc Gyssens, Peter Jeavons
Issue Date:January 1988
pp. 527-548
Many combinatorial search problems can be expressed as “constraint satisfaction problems” and this class of problems is known to be NP-complete in general. In this paper, we investigate the subclasses that arise from restricting the possible co...
Emulation of computer networks by microprogrammable microcomputers
Found in: Conference record of the 7th annual workshop on Microprogramming (MICRO 7)
By David Cohen, Ming T. Liu
Issue Date:September 1974
pp. 159-167
The advent of low cost, sophisticated, microprogrammable, LSI microprocessors has renewed interest in multiple-computer systems. This paper suggests a method of implementing microprogrammable microcomputer systems as a sophisticated tool (emulators) for de...
Exploiting response models: optimizing cross-sell and up-sell opportunities in banking
Found in:
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '02)
By Andrew Storey, Marc-david Cohen
Issue Date:July 2002
pp. 325-331
The banking industry regularly mounts campaigns to improve customer value by offering new products to existing customers. In recent years this approach has gained significant momentum because of the increasing availability of customer data and the improved...
1
Original Search Engine
Need a Web Account?
For Members
For Non-members
Become a Member