Sciweavers

21094 search results - page 4089 / 4219
» An experiment using DLV-K
Sort
View
100
Voted
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 5 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
SIGMETRICS
2010
ACM
143views Hardware» more  SIGMETRICS 2010»
15 years 5 months ago
Practical performance models for complex, popular applications
Perhaps surprisingly, no practical performance models exist for popular (and complex) client applications such as Adobe’s Creative Suite, Microsoft’s Office and Visual Studio...
Eno Thereska, Bjoern Doebel, Alice X. Zheng, Peter...
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 5 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
121
Voted
SIGMOD
2010
ACM
262views Database» more  SIGMOD 2010»
15 years 5 months ago
K-nearest neighbor search for fuzzy objects
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Kai Zheng, Gabriel Pui Cheong Fung, Xiaofang Zhou
113
Voted
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 5 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
« Prev « First page 4089 / 4219 Last » Next »