Sciweavers

2834 search results - page 220 / 567
» Representing Trees with Constraints
Sort
View
CORR
2012
Springer
209views Education» more  CORR 2012»
13 years 8 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu
117
Voted
ACL
2012
13 years 3 months ago
String Re-writing Kernel
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referre...
Fan Bu, Hang Li, Xiaoyan Zhu
CVPR
2008
IEEE
16 years 2 months ago
Global pose estimation using non-tree models
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...
Hao Jiang, David R. Martin
98
Voted
ICML
2008
IEEE
16 years 1 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
86
Voted
CORR
2010
Springer
117views Education» more  CORR 2010»
15 years 25 days ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou