Sciweavers

141 search results - page 20 / 29
» Destruction of Very Simple Trees
Sort
View
TALG
2008
127views more  TALG 2008»
13 years 7 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
13 years 6 months ago
A quadratic regulator-based heuristic for rapidly exploring state space
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
Elena Leah Glassman, Russ Tedrake
SPAA
2009
ACM
14 years 8 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
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...
BMCBI
2011
13 years 2 months ago
N-gram analysis of 970 microbial organisms reveals presence of biological language models
Background: It has been suggested previously that genome and proteome sequences show characteristics typical of natural-language texts such as “signature-style” word usage ind...
Hatice U. Osmanbeyoglu, Madhavi Ganapathiraju