Sciweavers

720 search results - page 91 / 144
» Linear k-arboricities on trees
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 10 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
ERLANG
2003
ACM
14 years 3 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
ICCV
2003
IEEE
14 years 12 months ago
A Multi-scale Generative Model for Animate Shapes and Parts
This paper presents a multi-scale generative model for representing animate shapes and extracting meaningful parts of objects. The model assumes that animate shapes (2D simple clo...
Aleksandr Dubinskiy, Song Chun Zhu
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 10 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...
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
14 years 4 months ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...