Sciweavers

9209 search results - page 239 / 1842
» Data Space Randomization
Sort
View
RECOMB
2004
Springer
16 years 6 months ago
Aligning alignments exactly
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Dean Starrett
CHI
2010
ACM
16 years 1 months ago
UpStream: motivating water conservation with low-cost water flow sensing and persuasive displays
Water is our most precious and most rapidly declining natural resource. We explore pervasive technology as an approach for promoting water conservation in public and private space...
Stacey Kuznetsov, Eric Paulos
GLOBECOM
2008
IEEE
16 years 25 days ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
NCA
2007
IEEE
16 years 19 days ago
A Topological Analysis of Monitor Placement
The Internet is an extremely complex system, and it is essential that we be able to make accurate measurements in order to understand its underlying behavior or to detect improper...
Alden W. Jackson, Walter C. Milliken, Cesar A. San...
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
16 years 14 days ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner