Sciweavers

2583 search results - page 223 / 517
» On the Representation of Timed Polyhedra
Sort
View
GBRPR
2009
Springer
15 years 10 months ago
Homeomorphic Alignment of Edge-Weighted Trees
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...
Benjamin Raynal, Michel Couprie, Venceslas Biri
DIS
2004
Springer
15 years 10 months ago
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Ari...
IJCAI
2007
15 years 8 months ago
Towards Reasoning about the Past in Neural-symbolic Systems
Reasoning about the past is of fundamental importance in several applications in computer science and artificial intelligence, including reactive systems and planning. In this pa...
Rafael V. Borges, Luís C. Lamb, Artur S. d'...
NAACL
2007
15 years 8 months ago
Incremental Non-Projective Dependency Parsing
An open issue in data-driven dependency parsing is how to handle non-projective dependencies, which seem to be required by linguistically adequate representations, but which pose ...
Joakim Nivre
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
15 years 8 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...