Sciweavers

3105 search results - page 467 / 621
» The Path-Packing Structure of Graphs
Sort
View
WADS
2007
Springer
121views Algorithms» more  WADS 2007»
15 years 10 months ago
Cauchy's Theorem and Edge Lengths of Convex Polyhedra
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
15 years 10 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...
CVPR
2006
IEEE
15 years 10 months ago
Globally Optimal Grouping for Symmetric Boundaries
Many natural and man-made structures have a boundary that shows certain level of bilateral symmetry, a property that has been used to solve many computer-vision tasks. In this pap...
Joachim S. Stahl, Song Wang
ASWEC
2005
IEEE
15 years 9 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...
ER
2005
Springer
186views Database» more  ER 2005»
15 years 9 months ago
Blueprints and Measures for ETL Workflows
Extract-Transform-Load (ETL) workflows are data centric workflows responsible for transferring, cleaning, and loading data from their respective sources to the warehouse. Previous ...
Panos Vassiliadis, Alkis Simitsis, Manolis Terrovi...