2200 search results - page 234 / 440 » Bloch's Constant is Computable |
141
click to vote
SAC
2006
ACM
16 years 14 days ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
180
click to vote
SAC
2006
ACM
16 years 14 days ago
2006
ACM
CT As computing devices are getting smaller, we tend to bring them everywhere. Consequently the operating conditions of the devices are constantly changing (e.g. changing user requ...
173
click to vote
IPPS
2005
IEEE
16 years 3 days ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
167
click to vote
IPPS
2005
IEEE
16 years 3 days ago
2005
IEEE
The next generation of mobile systems with multimedia processing capabilities and wireless connectivity will be increasingly deployed in highly dynamic and distributed environment...
169
click to vote
SPAA
2005
ACM
16 years 2 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...