Sciweavers

535 search results - page 17 / 107
» Generalized Version Space Trees
Sort
View
COMPGEOM
2010
ACM
15 years 4 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
14 years 11 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
15 years 6 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
MFCS
2000
Springer
15 years 3 months ago
Bilinear Functions and Trees over the (max, +) Semiring
Abstract. We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (...
Sabrina Mantaci, Vincent D. Blondel, Jean Mairesse
CORR
2006
Springer
153views Education» more  CORR 2006»
14 years 11 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon