2107 search results - page 144 / 422 » Computing Small Search Numbers in Linear Time |
162
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
143
Voted
PPOPP
2006
ACM
15 years 9 months ago
2006
ACM
Recently, the high-performance computing community has realized that power is a performance-limiting factor. One reason for this is that supercomputing centers have limited power ...
142
Voted
CRYPTO
2012
Springer
13 years 6 months ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
164
Voted
SPAA
1999
ACM
15 years 8 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
146
Voted
TMI
2010
15 years 1 months ago
2010
—We present a computer-aided detection (CAD) system for computed tomography colonography that orders the polyps according to clinical relevance. The CAD system consists of two st...