Sciweavers

184 search results - page 22 / 37
» Querying Proofs
Sort
View
ECCC
2008
122views more  ECCC 2008»
13 years 7 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
GEOINFO
2004
13 years 9 months ago
Mediated Geographic Web Feature Services
Abstract With the proliferation of Geographic Information Systems (GIS) and spatial resources over the Internet, there is an increasing demand for robust geospatial information ser...
Mehdi Essid, Omar Boucelma
SERVICES
2008
246views more  SERVICES 2008»
13 years 9 months ago
BioFlow: A Web-Based Declarative Workflow Language for Life Sciences
Scientific workflows in Life Sciences are usually complex, and use many online databases, analysis tools, publication repositories and customized computation intensive desktop sof...
Hasan M. Jamil, Bilal El-Hajj-Diab
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 8 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
INFOCOM
2006
IEEE
14 years 1 months ago
Information Dissemination in Power-Constrained Wireless Networks
— Dissemination of common information through broadcasting is an integral part of wireless network operations such as query of interested events, resource discovery and code upda...
Rong Zheng