Sciweavers

6274 search results - page 657 / 1255
» From query complexity to computational complexity
Sort
View
224
Voted
FOCS
2008
IEEE
16 years 1 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
243
Voted
CIE
2007
Springer
15 years 11 months ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...
327
Voted
GIS
2005
ACM
16 years 8 months ago
Monitoring dynamic spatial fields using responsive geosensor networks
Information about dynamic spatial fields, such as temperature, windspeed, or the concentration of gas pollutant in the air, is important for many environmental applications. At th...
Matt Duckham, Silvia Nittel, Michael F. Worboys
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
MIDDLEWARE
2004
Springer
16 years 19 days ago
Foreseer: A Novel, Locality-Aware Peer-to-Peer System Architecture for Keyword Searches
Peer-to-peer (P2P) systems are becoming increasingly popular and complex, serving millions of users today. However, the design of current unstructured P2P systems does not take ful...
Hailong Cai, Jun Wang