Sciweavers

3708 search results - page 110 / 742
» Approximating Betweenness Centrality
Sort
View
EDBT
2002
ACM
129views Database» more  EDBT 2002»
16 years 24 days ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
100
Voted
EDBT
2009
ACM
127views Database» more  EDBT 2009»
15 years 7 months ago
Approximate substring selectivity estimation
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
102
Voted
DASFAA
2008
IEEE
150views Database» more  DASFAA 2008»
15 years 7 months ago
Approximate Clustering of Time Series Using Compact Model-Based Descriptions
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
97
Voted
ICASSP
2008
IEEE
15 years 7 months ago
Collusion-aware traitor tracing in multimedia fingerprinting using sparse signal approximation
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
David P. Varodayan, Christine Pépin
ICC
2008
IEEE
130views Communications» more  ICC 2008»
15 years 7 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi