Sciweavers

250 search results - page 46 / 50
» Fixed Argument Pairings
Sort
View
MOBIHOC
2009
ACM
16 years 9 days ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
83
Voted
RECOMB
2004
Springer
16 years 1 days 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
92
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 1 days ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
PODS
2005
ACM
211views Database» more  PODS 2005»
15 years 12 months ago
Join-distinct aggregate estimation over update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
SOSP
2009
ACM
15 years 8 months ago
Debugging in the (very) large: ten years of implementation and experience
Windows Error Reporting (WER) is a distributed system that automates the processing of error reports coming from an installed base of a billion machines. WER has collected billion...
Kirk Glerum, Kinshuman Kinshumann, Steve Greenberg...