Sciweavers

1274 search results - page 91 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
ICASSP
2010
IEEE
15 years 25 days ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
105
Voted
EOR
2010
178views more  EOR 2010»
15 years 22 days ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...
101
Voted
JUCS
2007
118views more  JUCS 2007»
15 years 16 days ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
107
Voted
DAGSTUHL
2008
15 years 2 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
ICCV
2009
IEEE
16 years 5 months ago
Multimodal Partial Estimates Fusion
Fusing partial estimates is a critical and common problem in many computer vision tasks such as part-based detection and tracking. It generally becomes complicated and intractab...
Jiang Xu, Junsong Yuan, YingWu