Sciweavers

1350 search results - page 144 / 270
» Generalized Committed Choice
Sort
View
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 5 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
WWW
2004
ACM
16 years 5 months ago
How to make a semantic web browser
Two important architectural choices underlie the success of the Web: numerous, independently operated servers speak a common protocol, and a single type of client--the Web browser...
D. A. Quan, R. Karger
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 1 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
WWW
2010
ACM
15 years 11 months ago
Inferring relevant social networks from interpersonal communication
Researchers increasingly use electronic communication data to construct and study large social networks, effectively inferring unobserved ties (e.g. i is connected to j) from obs...
Munmun De Choudhury, Winter A. Mason, Jake M. Hofm...
SAC
2009
ACM
15 years 11 months ago
An empirical study of incorporating cost into test suite reduction and prioritization
Software developers use testing to gain and maintain confidence in the correctness of a software system. Automated reduction and prioritization techniques attempt to decrease the...
Adam M. Smith, Gregory M. Kapfhammer