Sciweavers

213 search results - page 11 / 43
» Counting Independent Sets Using the Bethe Approximation
Sort
View
PODS
2000
ACM
179views Database» more  PODS 2000»
15 years 4 months ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
ECAI
2010
Springer
14 years 9 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
DCOSS
2006
Springer
15 years 3 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
82
Voted
ICALP
2005
Springer
15 years 5 months ago
A Better Approximation Ratio for the Vertex Cover Problem
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
George Karakostas
ICA
2007
Springer
15 years 3 months ago
Compact Representations of Market Securities Using Smooth Component Extraction
Independent Component Analysis (ICA) is a statistical method for expressing an observed set of random vectors as a linear combination of statistically independent components. This...
Hariton Korizis, Nikolaos Mitianoudis, Anthony G. ...