1331 search results - page 88 / 267 » Complexity bounds for zero-test algorithms |
95
Voted
PDPTA
2004
15 years 4 months ago
2004
We present the MBRAM model for static evaluation of the performance of memory-bound programs. The MBRAM model predicts the actual running time of a memory-bound program directly fr...
147
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
145
click to vote
WINE
2005
Springer
15 years 8 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
88
Voted
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
The overlay of 2 ≤ m ≤ d minimization diagrams of n surfaces in Rd is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in Rd+m−1 . ...
141
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
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...