4865 search results - page 539 / 973 » The Complexity of Graph Connectivity |
207
click to vote
SSD
2009
Springer
16 years 1 months ago
2009
Springer
The standard database mechanisms for concurrency control, which include transactions and locking protocols, do not provide the support needed for updating complex geographic data i...
224
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
208
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
204
click to vote
CRYPTO
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
198
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...