Sciweavers

5606 search results - page 525 / 1122
» Randomization Techniques for Graphs.
Sort
View
PODC
2003
ACM
16 years 4 days ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
SOFSEM
2001
Springer
15 years 11 months ago
How Can Computer Science Contribute to Knowledge Discovery?
Knowledge discovery, that is, to analyze a given massive data set and derive or discover some knowledge from it, has been becoming a quite important subject in several fields incl...
Osamu Watanabe
ISLPED
1999
ACM
47views Hardware» more  ISLPED 1999»
15 years 11 months ago
Databus charge recovery: practical considerations
The charge recovery databus is a scheme which reduces energy consumption through the application of adiabatic circuit techniques. Previous work 2 gives a solid theoretical analysi...
Benjamin Bishop, Mary Jane Irwin
ICAD
2004
15 years 8 months ago
Towards Enhancing Earthquake Response Interpretation Using Sonification
In this paper, we select the application domain of earthquake engineering for utility of sonification, where signals are of random frequency and amplitude content. In particular, ...
Lakshmy Ramaswamy, Tara C. Hutchinson, Falko Kuest...
NETWORKS
2008
15 years 6 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth