Sciweavers

2192 search results - page 130 / 439
» Algorithms for Challenging Motif Problems
Sort
View
FMCAD
2004
Springer
14 years 22 hour ago
A Partitioning Methodology for BDD-Based Verification
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain,...
AAAI
2007
13 years 10 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck
MM
2010
ACM
115views Multimedia» more  MM 2010»
13 years 6 months ago
Interactive learning of heterogeneous visual concepts with local features
In the context of computer-assisted plant identification we are facing challenging information retrieval problems because of the very high within-class variability and of the lim...
Wajih Ouertani, Michel Crucianu, Nozha Boujemaa
CVPR
2011
IEEE
13 years 4 months ago
Shape Estimation in Natural Illumination
The traditional shape-from-shading problem, with a single light source and Lambertian reflectance, is challenging since the constraints implied by the illumination are not suffi...
Micah Johnson, Edward Adelson
ICML
2008
IEEE
14 years 9 months ago
On partial optimality in multi-label MRFs
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
Pushmeet Kohli, Alexander Shekhovtsov, Carsten Rot...