Sciweavers

728 search results - page 49 / 146
» Compressing combinatorial objects
Sort
View
SIGGRAPH
1998
ACM
13 years 11 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...
BMCBI
2010
143views more  BMCBI 2010»
13 years 4 months ago
A genome alignment algorithm based on compression
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
ISPD
1997
ACM
74views Hardware» more  ISPD 1997»
13 years 11 months ago
A matrix synthesis approach to thermal placement
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...
Chris C. N. Chu, D. F. Wong
EOR
2010
96views more  EOR 2010»
13 years 7 months ago
The hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
Rubén Ruiz, José Antonio Vázq...
DCG
2007
58views more  DCG 2007»
13 years 7 months ago
Harmonic Algebraic Curves and Noncrossing Partitions
Motivated by Gauss’s first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bou...
Jeremy L. Martin, David Savitt, Ted Singer