269 search results - page 35 / 54 » The Quantitative Structure of Exponential Time |
140
click to vote
PODS
2008
ACM
16 years 2 months ago
2008
ACM
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
114
Voted
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
140
click to vote
CVPR
2010
IEEE
15 years 10 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...
113
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
103
click to vote
CPAIOR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...