Sciweavers

1248 search results - page 143 / 250
» On the Number of Birch Partitions
Sort
View
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 10 months ago
Layout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
Vida Dujmovic, Pat Morin, David R. Wood
CPHYSICS
2004
93views more  CPHYSICS 2004»
13 years 10 months ago
Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
Gernot Schaller, Michael Meyer-Hermann
DPD
2000
93views more  DPD 2000»
13 years 10 months ago
Ontological Approach for Information Discovery in Internet Databases
The Internet has solved the age-old problem of network connectivity and thus enabling the potential access to, and data sharing among large numbers of databases. However, enabling ...
Mourad Ouzzani, Boualem Benatallah, Athman Bouguet...
GPEM
2000
103views more  GPEM 2000»
13 years 10 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
IPL
2002
118views more  IPL 2002»
13 years 9 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...