496 search results - page 60 / 100 » Machine models and lower bounds for query processing |
100
Voted
LICS
1994
IEEE
15 years 1 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
3DIM
2005
IEEE
15 years 3 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
PVLDB
2008
14 years 9 months ago
2008
Query processing on uncertain data streams has attracted a lot of attentions lately, due to the imprecise nature in the data generated from a variety of streaming applications, su...
195
Voted
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...