Sciweavers

151 search results - page 25 / 31
» Derandomized Squaring of Graphs
Sort
View
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 8 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
AIPS
2010
13 years 7 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...

Publication
400views
15 years 1 months ago
Enforcing Integrability by Error Correction using L1-minimization
Surface reconstruction from gradient fields is an important final step in several applications involving gradient manipulations and estimation. Typically, the resulting gradient ...
Dikpal Reddy, Amit K. Agrawal, Rama Chellappa
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
14 years 11 months ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
ECCV
2004
Springer
14 years 8 months ago
Face Recognition with Local Binary Patterns
In this work, we present a novel approach to face recognition which considers both shape and texture information to represent face images. The face area is first divided into small...
Abdenour Hadid, Matti Pietikäinen, Timo Ahone...