Sciweavers

320 search results - page 39 / 64
» Evaluation of Solving Models for Conditional Constraint Sati...
Sort
View
150
Voted
FOCS
1998
IEEE
15 years 7 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
89
Voted
ICASSP
2008
IEEE
15 years 10 months ago
Iterative R-D optimization of H.264
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. T...
Cheolhong An, Truong Q. Nguyen
DBPL
2007
Springer
103views Database» more  DBPL 2007»
15 years 7 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
CVPR
2008
IEEE
16 years 5 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
125
Voted
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 3 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis