Sciweavers

6274 search results - page 231 / 1255
» From query complexity to computational complexity
Sort
View
CONCUR
2009
Springer
15 years 11 months ago
Query-Based Model Checking of Ad Hoc Network Protocols
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
CHI
2011
ACM
14 years 8 months ago
Materializing the query with facet-streams: a hybrid surface for collaborative search on tabletops
We introduce “Facet-Streams”, a hybrid interactive surface for co-located collaborative product search on a tabletop. Facet-Streams combines techniques of information visualiz...
Hans-Christian Jetter, Jens Gerken, Michael Zö...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 5 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
SIGMOD
2007
ACM
122views Database» more  SIGMOD 2007»
16 years 5 months ago
XQuery layers
XML is the data interoperability standard in many application domains. Therefore, an increasing number of researchers and professionals, who are not computer scientists (although ...
Daniele Braga, Alessandro Campi, Stefano Ceri, Pao...
COLT
2006
Springer
15 years 8 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans