400 search results - page 61 / 80 » Lower Bounds Using Kolmogorov Complexity |
CAD
2004
Springer
13 years 8 months ago
2004
Springer
We present a system, ESOLID, that performs exact boundary evaluation of low-degree curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using e...
WDAG
2005
Springer
14 years 2 months ago
2005
Springer
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
TCC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...