963 search results - page 75 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
116
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
116
click to vote
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
CP
2004
Springer
15 years 5 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Tensor based dimensionality reduction has recently been extensively studied for computer vision applications. To our knowledge, however, there exist no rigorous error analysis on ...
104
click to vote
UAI
2004
15 years 1 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...