Sciweavers

3607 search results - page 158 / 722
» Learning with structured sparsity
Sort
View
133
Voted
SSPR
2000
Springer
15 years 7 months ago
Prototype Learning with Attributed Relational Graphs
An algorithm for learning structural patterns given in terms of Attributed Relational Graphs (ARG's) is presented. The algorithm, based on inductive learning methodologies, pr...
Pasquale Foggia, Roberto Genna, Mario Vento
153
Voted
ECAI
2006
Springer
15 years 7 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...
125
Voted
OSDI
2008
ACM
16 years 4 months ago
Digging for Data Structures
Because writing computer programs is hard, computer programmers are taught to use encapsulation and modularity to hide complexity and reduce the potential for errors. Their progra...
Anthony Cozzie, Frank Stratton, Hui Xue, Samuel T....
113
Voted
ML
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 3 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
141
Voted
ICML
2005
IEEE
16 years 4 months ago
Predicting protein folds with structural repeats using a chain graph model
Protein fold recognition is a key step towards inferring the tertiary structures from amino-acid sequences. Complex folds such as those consisting of interacting structural repeat...
Yan Liu, Eric P. Xing, Jaime G. Carbonell