Sciweavers

4315 search results - page 181 / 863
» Sorting in linear time
Sort
View
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
14 years 1 months ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
14 years 1 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
ICCAD
2010
IEEE
158views Hardware» more  ICCAD 2010»
13 years 7 months ago
Novel binary linear programming for high performance clock mesh synthesis
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
Minsik Cho, David Z. Pan, Ruchir Puri
SMA
2009
ACM
105views Solid Modeling» more  SMA 2009»
14 years 3 months ago
SOT: compact representation for tetrahedral meshes
The Corner Table (CT) promoted by Rossignac et al. provides a simple and efficient representation of triangle meshes, storing 6 integer references per triangle (3 vertex reference...
Topraj Gurung, Jarek Rossignac
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
13 years 9 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama