Sciweavers

2150 search results - page 347 / 430
» On a restricted cross-intersection problem
Sort
View
ACCV
2006
Springer
14 years 4 months ago
Dense Motion and Disparity Estimation Via Loopy Belief Propagation
We describe a method for computing a dense estimate of motion and disparity, given a stereo video sequence containing moving non-rigid objects. In contrast to previous approaches, ...
Michael Isard, John MacCormick
SPAA
2005
ACM
14 years 3 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 3 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
AGP
2010
IEEE
14 years 3 months ago
Constraint Logic Programming
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Marco Gavanelli, Francesca Rossi
ESOP
2001
Springer
14 years 2 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing