Sciweavers

588 search results - page 113 / 118
» Positive higher-order queries
Sort
View
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
13 years 11 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
DBPL
1997
Springer
117views Database» more  DBPL 1997»
13 years 11 months ago
Degrees of Monotonicity of Spatial Transformations
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hi...
Bart Kuijpers
PLDI
2010
ACM
13 years 11 months ago
Detecting Inefficiently-Used Containers to Avoid Bloat
Runtime bloat degrades significantly the performance and scalability of software systems. An important source of bloat is the inefficient use of containers. It is expensive to cre...
Guoqing Xu, Atanas Rountev
KDD
2010
ACM
190views Data Mining» more  KDD 2010»
13 years 11 months ago
User browsing models: relevance versus examination
There has been considerable work on user browsing models for search engine results, both organic and sponsored. The click-through rate (CTR) of a result is the product of the prob...
Ramakrishnan Srikant, Sugato Basu, Ni Wang, Daryl ...
CSL
2009
Springer
13 years 11 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe