Sciweavers

6598 search results - page 1226 / 1320
» Graph Theory with Applications
Sort
View
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 9 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 9 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
MIDDLEWARE
2004
Springer
15 years 9 months ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
RT
2004
Springer
15 years 9 months ago
Bixels: Picture Samples with Sharp Embedded Boundaries
Pixels store a digital image as a grid of point samples that can reconstruct a limited-bandwidth continuous 2-D source image. Although convenient for anti-aliased display, these b...
Jack Tumblin, Prasun Choudhury
ICDAR
2003
IEEE
15 years 9 months ago
A Constraint-based Approach to Table Structure Derivation
er presents an approach to deriving an abstract geometric model of a table from a physical representation. The technique developed uses a graph of constraints between cells which ...
Matthew Hurst
« Prev « First page 1226 / 1320 Last » Next »