Sciweavers

1479 search results - page 197 / 296
» Management without (Detailed) Models
Sort
View
SIGMOD
2011
ACM
267views Database» more  SIGMOD 2011»
14 years 7 months ago
A latency and fault-tolerance optimizer for online parallel query plans
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
Prasang Upadhyaya, YongChul Kwon, Magdalena Balazi...
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 6 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
117
Voted
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 5 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
WISTP
2010
Springer
15 years 11 months ago
Fraud Detection for Voice over IP Services on Next-Generation Networks
The deployment of Next-Generation Networks (NGN) is a challenge that requires integrating heterogeneous services into a global system of All-IP telecommunications. These networks c...
Igor Ruiz-Agundez, Yoseba K. Penya, Pablo Garcia B...
152
Voted
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
15 years 11 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...