Sciweavers

4377 search results - page 91 / 876
» Mass problems and randomness
Sort
View
VMV
2001
303views Visualization» more  VMV 2001»
15 years 6 months ago
Extracting Cylinders in Full 3D Data Using a Random Sampling Method and the Gaussian Image
This paper presents a new method for extracting cylinders from an unorganized set of 3D points. The originality of this approach is to separate the extraction problem into two dis...
Thomas Chaperon, François Goulette
RSA
2011
77views more  RSA 2011»
15 years 12 days ago
Regular induced subgraphs of a random Graph
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
Michael Krivelevich, Benny Sudakov, Nicholas C. Wo...
OR
2005
Springer
15 years 11 months ago
Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...
Zeynep Özyurt, Deniz Aksen, Necati Aras
ICCV
2011
IEEE
14 years 5 months ago
Conditional Random Fields for Multi-Camera Object Detection
We formulate a model for multi-class object detection in a multi-camera environment. From our knowledge, this is the first time that this problem is addressed taken into account ...
Xavier Boix, Gemma Roig, Horesh Ben Shitrit, Pasca...
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
15 years 11 months ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang