Sciweavers

8099 search results - page 1544 / 1620
» Higher-Order Task Models
Sort
View
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 3 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
16 years 3 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma
132
Voted
ICALP
2009
Springer
16 years 3 months ago
Functional Monitoring without Monotonicity
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...
Chrisil Arackaparambil, Joshua Brody, Amit Chakrab...
VLDB
2008
ACM
170views Database» more  VLDB 2008»
16 years 3 months ago
A layered framework supporting personal information integration and application design for the semantic desktop
With the development of inexpensive storage devices, space usage is no longer a bottleneck for computer users. However, the increasingly large amount of personal information poses ...
Isabel F. Cruz, Huiyong Xiao
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 3 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
« Prev « First page 1544 / 1620 Last » Next »