Sciweavers

481 search results - page 34 / 97
» Learning relational probability trees
Sort
View
ICML
2004
IEEE
14 years 8 months ago
A hierarchical method for multi-class support vector machines
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
Volkan Vural, Jennifer G. Dy
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
14 years 2 months ago
Robust web extraction: an approach based on a probabilistic tree-edit model
On script-generated web sites, many documents share common HTML tree structure, allowing wrappers to effectively extract information of interest. Of course, the scripts and thus ...
Nilesh N. Dalvi, Philip Bohannon, Fei Sha
ECCV
2008
Springer
14 years 9 months ago
Keypoint Signatures for Fast Learning and Recognition
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
Michael Calonder, Vincent Lepetit, Pascal Fua
LCPC
2007
Springer
14 years 1 months ago
Modeling Relations between Inputs and Dynamic Behavior for General Programs
Program dynamic optimization, adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations o...
Xipeng Shen, Feng Mao
ECAI
2006
Springer
13 years 11 months ago
Semantic Tree Kernels to Classify Predicate Argument Structures
Recent work on Semantic Role Labeling (SRL) has shown that syntactic information is critical to detect and extract predicate argument structures. As syntax is expressed by means of...
Alessandro Moschitti, Bonaventura Coppola, Daniele...