1920 search results - page 33 / 384 » The Complexity of the A B C Problem |
161
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
118
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
159
Voted
DAC
2010
ACM
15 years 9 months ago
2010
ACM
Research on Networks on Chips (NoCs) has spanned over a decade and its results are now visible in some products. Thus the seminal idea of using networking technology to address th...
152
click to vote
SIAMJO
2008
15 years 5 months ago
2008
A first order affine scaling method and two mth order affine scaling methods for solving monotone linear complementarity problems (LCP) are presented. All three methods produce ite...
129
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...