Sciweavers

599 search results - page 114 / 120
» Approximation Algorithms for Dominating Set in Disk Graphs
Sort
View
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 2 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
CVPR
2001
IEEE
14 years 9 months ago
Generic Model Abstraction from Examples
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
Yakov Keselman, Sven J. Dickinson
ICALP
2005
Springer
14 years 1 months ago
Stochastic Steiner Trees Without a Root
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
Anupam Gupta, Martin Pál
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 8 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
CAV
2012
Springer
231views Hardware» more  CAV 2012»
11 years 10 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi