Sciweavers

2750 search results - page 492 / 550
» Learning Efficient Parsing
Sort
View
CGF
2008
192views more  CGF 2008»
13 years 10 months ago
Non-Rigid Registration Under Isometric Deformations
We present a robust and efficient algorithm for the pairwise non-rigid registration of partially overlapping 3D surfaces. Our approach treats non-rigid registration as an optimiza...
Qi-Xing Huang, Bart Adams, Martin Wicke, Leonidas ...
CONSTRAINTS
2008
182views more  CONSTRAINTS 2008»
13 years 10 months ago
Constraint Programming in Structural Bioinformatics
Bioinformatics aims at applying computer science methods to the wealth of data collected in a variety of experiments in life sciences (e.g. cell and molecular biology, biochemistry...
Pedro Barahona, Ludwig Krippahl
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 10 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 10 months ago
Modeling the structure and evolution of discussion cascades
We analyze the structure and evolution of discussion cascades in four popular websites: Slashdot, Barrapunto, Meneame and Wikipedia. Despite the big heterogeneities between these ...
Vicenç Gómez, Hilbert J. Kappen, And...
AI
2006
Springer
13 years 10 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth