Sciweavers

2834 search results - page 176 / 567
» Representing Trees with Constraints
Sort
View
IROS
2006
IEEE
132views Robotics» more  IROS 2006»
14 years 4 months ago
Closing a Million-Landmarks Loop
— We present an improved version of the treemap SLAM algorithm which uses Cholesky factors for representing Gaussians and a Hierarchical Tree Partitioning algorithm derived from ...
Udo Frese, Lutz Schroder
SAINT
2005
IEEE
14 years 4 months ago
Learning Logic Wrappers for Information Extraction from the Web
This paper discusses a methodology for applying general-purpose first-order inductive learning to extract information from Web documents structured as unranked ordered trees. The...
Costin Badica, Elvira Popescu, Amelia Badica
CHI
1994
ACM
14 years 2 months ago
Multitrees: enriching and reusing hierarchical structure
This paper introduces multitrees, a new type of structure for representing information. Multitrees are a class of directed acyclic graphs (DAGs) with the unusual property that the...
George W. Furnas, Jeff Zacks
SODA
2004
ACM
108views Algorithms» more  SODA 2004»
14 years 4 days ago
A certifying algorithm for the consecutive-ones property
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
Ross M. McConnell
IJFCS
2006
108views more  IJFCS 2006»
13 years 10 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth