Sciweavers

231 search results - page 23 / 47
» On overlays and minimization diagrams
Sort
View
82
Voted
DAM
2008
135views more  DAM 2008»
14 years 9 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
CPAIOR
2007
Springer
15 years 3 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
CLA
2007
14 years 11 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
15 years 10 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
BXML
2003
14 years 11 months ago
Rule-Based Generation of XML Schemas from UML Class Diagrams
We present an approach of how to automatically extract an XML document structure from a conceptual data model that describes the content of the document. We use UML class diagrams ...
Tobias Krumbein, Thomas Kudrass