Sciweavers

1813 search results - page 80 / 363
» Instance Pruning Techniques
Sort
View
CIKM
2011
Springer
14 years 4 months ago
Towards a framework for attribute retrieval
In this paper, we propose an attribute retrieval approach which extracts and ranks attributes from HTML tables. We distinguish between class attribute retrieval and instance attri...
Arlind Kopliku, Mohand Boughanem, Karen Pinel-Sauv...
DLS
2005
176views Languages» more  DLS 2005»
15 years 6 months ago
Dynamic data polyvariance using source-tagged classes
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
S. Alexander Spoon, Olin Shivers
119
Voted
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
15 years 11 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
AIPS
2006
15 years 6 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith
ICDM
2010
IEEE
228views Data Mining» more  ICDM 2010»
15 years 1 months ago
Active Learning from Multiple Noisy Labelers with Varied Costs
In active learning, where a learning algorithm has to purchase the labels of its training examples, it is often assumed that there is only one labeler available to label examples, ...
Yaling Zheng, Stephen D. Scott, Kun Deng