Sciweavers

95 search results - page 6 / 19
» Lines, Trees, and Branch Spaces
Sort
View
CPM
2001
Springer
130views Combinatorics» more  CPM 2001»
13 years 12 months ago
On-Line Construction of Compact Directed Acyclic Word Graphs
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...
ICTAI
2003
IEEE
14 years 22 days ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
CLASSIFICATION
2008
84views more  CLASSIFICATION 2008»
13 years 7 months ago
Degenerating Families of Dendrograms
Dendrograms used in data analysis are ultrametric spaces, hence objects of nonarchimedean geometry. It is known that there exist p-adic representations of dendrograms. Completed b...
Patrick Erik Bradley
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 7 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
CVPR
2012
IEEE
11 years 10 months ago
Learning 3D object templates by hierarchical quantization of geometry and appearance spaces
This paper presents a method for learning 3D object templates from view labeled object images. The 3D template is defined in a joint appearance and geometry space, and is compose...
Wenze Hu