Sciweavers

46 search results - page 2 / 10
» The Benefits of Relaxing Punctuality
Sort
View
CCCG
2009
13 years 6 months ago
Relaxed Gabriel Graphs
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with skeletons for [0, 1]...
Prosenjit Bose, Jean Cardinal, Sébastien Co...
JMLR
2006
124views more  JMLR 2006»
13 years 5 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
COR
2006
98views more  COR 2006»
13 years 5 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
VL
2005
IEEE
108views Visual Languages» more  VL 2005»
13 years 10 months ago
Achieving Flexibility in Direct-Manipulation Programming Environments by Relaxing the Edit-Time Grammar
Structured program editors can lower the entry barrier for beginning computer science students by preventing syntax errors. However, when editors force programs to be executable a...
Benjamin E. Birnbaum, Kenneth J. Goldman
MICRO
2010
IEEE
202views Hardware» more  MICRO 2010»
13 years 1 days ago
Hardware Support for Relaxed Concurrency Control in Transactional Memory
Today's transactional memory systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict happens. 2PL is a simple algorithm that pr...
Utku Aydonat, Tarek S. Abdelrahman