575 search results - page 64 / 115 » A Spectral Approach to Lower Bounds |
124
Voted
JCSS
2000
15 years 13 days ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
119
click to vote
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
The type of representation used in describing shape can have a significant impact on the effectiveness of a recognition strategy. Shape has been represented by its bounding curve ...
87
Voted
ICALP
2009
Springer
16 years 28 days ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
96
Voted
PERCOM
2008
ACM
16 years 7 days ago
2008
ACM
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
87
Voted
DCC
2006
IEEE
16 years 7 days ago
2006
IEEE
We give new recursive constructions of complete caps in PG(n, 2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to ...