Sciweavers

370 search results - page 62 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 8 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
ICALP
2007
Springer
14 years 1 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie
ICASSP
2011
IEEE
12 years 11 months ago
Entropy estimation using the principle of maximum entropy
In this paper, we present a novel entropy estimator for a given set of samples drawn from an unknown probability density function (PDF). Counter to other entropy estimators, the e...
Behrouz Behmardi, Raviv Raich, Alfred O. Hero
TOIS
2008
145views more  TOIS 2008»
13 years 7 months ago
Classification-aware hidden-web text database selection
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over multip...
Panagiotis G. Ipeirotis, Luis Gravano
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
14 years 7 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin