Sciweavers

21324 search results - page 3894 / 4265
» Making the case for computing
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 9 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
SPAA
2003
ACM
15 years 9 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
ECAL
2003
Springer
15 years 9 months ago
A Universal Framework for Self-Replication
Abstract. Self-replication is a fundamental property of many interesting physical, formal and biological systems, such as crystals, waves, automata, and especially forms of natural...
Bryant Adams, Hod Lipson
ECCV
2010
Springer
15 years 9 months ago
Handling Urban Location Recognition as a 2D Homothetic Problem
Abstract. We address the problem of large scale place-of-interest recognition in cell phone images of urban scenarios. Here, we go beyond what has been shown in earlier approaches ...
FOCS
2002
IEEE
15 years 9 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
« Prev « First page 3894 / 4265 Last » Next »