Sciweavers

7988 search results - page 1171 / 1598
» A Useful Undecidable Theory
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 7 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
STOC
2002
ACM
126views Algorithms» more  STOC 2002»
16 years 7 months ago
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
Sean Hallgren
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 7 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin
PODS
2003
ACM
114views Database» more  PODS 2003»
16 years 7 months ago
An information-theoretic approach to normal forms for relational and XML data
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones...
Marcelo Arenas, Leonid Libkin
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 7 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
« Prev « First page 1171 / 1598 Last » Next »