Sciweavers

36 search results - page 3 / 8
» Dynamic Time-Linkage Problems Revisited
Sort
View
CP
2006
Springer
13 years 9 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider
LREC
2010
176views Education» more  LREC 2010»
13 years 6 months ago
There's no Data like More Data? Revisiting the Impact of Data Size on a Classification Task
In the paper we investigate the impact of data size on a Word Sense Disambiguation task (WSD). We question the assumption that the knowledge acquisition bottleneck, which is known...
Ines Rehbein, Josef Ruppenhofer
IJCV
2006
110views more  IJCV 2006»
13 years 5 months ago
Multi-body Factorization with Uncertainty: Revisiting Motion Consistency
Dynamic analysis of video sequences often relies on the segmentation of the sequence into regions of consistent motions. Approaching this problem requires a definition of which mo...
Lihi Zelnik-Manor, Moshe Machline, Michal Irani
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
13 years 10 months ago
Intransitivity revisited coevolutionary dynamics of numbers games
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
Pablo Funes, Enrique Pujals
CGF
2008
227views more  CGF 2008»
13 years 5 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...