Sciweavers

496 search results - page 84 / 100
» A Polynomial-Time Approximation Algorithm for a Geometric Di...
Sort
View
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
STACS
2010
Springer
14 years 2 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
CGF
2008
110views more  CGF 2008»
13 years 7 months ago
Motorcycle Graphs: Canonical Quad Mesh Partitioning
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
ICCAD
2008
IEEE
122views Hardware» more  ICCAD 2008»
14 years 4 months ago
Network flow-based power optimization under timing constraints in MSV-driven floorplanning
Abstract— Power consumption has become a crucial problem in modern circuit design. Multiple Supply Voltage (MSV) design is introduced to provide higher flexibility in controllin...
Qiang Ma, Evangeline F. Y. Young
JCC
2006
110views more  JCC 2006»
13 years 7 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs