Sciweavers

5169 search results - page 755 / 1034
» Locality approximation using time
Sort
View
CCS
2007
ACM
15 years 11 months ago
How much anonymity does network latency leak?
Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by “local” adversaries who control ...
Nicholas Hopper, Eugene Y. Vasserman, Eric Chan-Ti...
CGA
2008
15 years 4 months ago
Mobile 3D City Maps
ion and abstraction. By the end of the 20th century, technology had advanced to the point where computerized methods had revolutionized surveying and mapmaking practices. Now, the ...
Antti Nurminen
BMCBI
2010
101views more  BMCBI 2010»
15 years 5 months ago
Hidden Markov model speed heuristic and iterative HMM search procedure
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...
L. Steven Johnson, Sean R. Eddy, Elon Portugaly
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
16 years 6 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...
RECOMB
2004
Springer
16 years 5 months ago
The Statistical Significance of Max-Gap Clusters
Identifying gene clusters, genomic regions that share local similarities in gene organization, is a prerequisite for many different types of genomic analyses, including operon pred...
Rose Hoberman, David Sankoff, Dannie Durand