Sciweavers

194 search results - page 16 / 39
» The Parameterized Complexity of Some Minimum Label Problems
Sort
View
114
Voted
LREC
2010
191views Education» more  LREC 2010»
15 years 1 months ago
Spatial Role Labeling: Task Definition and Annotation Scheme
One of the essential functions of natural language is to talk about spatial relationships between objects. Linguistic constructs can express highly complex, relational structures ...
Parisa KordJamshidi, Martijn van Otterlo, Marie-Fr...
96
Voted
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 10 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
TCS
2010
14 years 11 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
AAAI
2006
15 years 1 months ago
Automatically Labeling the Inputs and Outputs of Web Services
Information integration systems combine data from multiple heterogeneous Web services to answer complex user queries, provided a user has semantically modeled the service first. T...
Kristina Lerman, Anon Plangprasopchok, Craig A. Kn...
MICCAI
2007
Springer
16 years 1 months ago
Non-rigid Image Registration Using Graph-cuts
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
Tommy W. H. Tang, Albert C. S. Chung