Sciweavers

2214 search results - page 226 / 443
» complexity 2004
Sort
View
163
Voted
SIMVIS
2004
15 years 6 months ago
3D Shape Matching Using Skeleton Graphs
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
Angela Brennecke, Tobias Isenberg
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 6 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
15 years 6 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff
SPLC
2004
15 years 6 months ago
COVAMOF: A Framework for Modeling Variability in Software Product Families
A key aspect of variability management in software product families is the explicit representation of the variability. Experiences at several industrial software development compan...
Marco Sinnema, Sybren Deelstra, Jos Nijhuis, Jan B...
UAI
2004
15 years 6 months ago
Sensitivity Analysis in Bayesian Networks: From Single to Multiple Parameters
Previous work on sensitivity analysis in Bayesian networks has focused on single parameters, where the goal is to understand the sensitivity of queries to single parameter changes...
Hei Chan, Adnan Darwiche