Sciweavers

5 search results - page 1 / 1
» Utilizing Automatically Inferred Invariants in Graph Constru...
Sort
View
CPAIOR
2010
Springer
13 years 2 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
KDD
2009
ACM
237views Data Mining» more  KDD 2009»
14 years 5 months ago
Exploring social tagging graph for web object classification
This paper studies web object classification problem with the novel exploration of social tags. Automatically classifying web objects into manageable semantic categories has long ...
Zhijun Yin, Rui Li, Qiaozhu Mei, Jiawei Han
ECCV
2010
Springer
13 years 6 months ago
A coarse-to-fine taxonomy of constellations for fast multi-class object detection
In order for recognition systems to scale to a larger number of object categories building visual class taxonomies is important to achieve running times logarithmic in the number o...
CIKM
2009
Springer
13 years 8 months ago
Semantic queries in databases: problems and challenges
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
Lipyeow Lim, Haixun Wang, Min Wang