Sciweavers

207 search results - page 2 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
14 years 1 days ago
Computing Elevation Maxima by Searching the Gauss Sphere
The elevation function on a smoothly embedded 2-manifold in R3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in iden...
Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov
ENGL
2007
180views more  ENGL 2007»
13 years 5 months ago
Reordering Algorithm for Minimizing Test Power in VLSI Circuits
— Power consumption has become a crucial concern in Built In Self Test (BIST) due to the switching activity in the circuit under test(CUT). In this paper we present a novel metho...
K. Paramasivam, K. Gunavathi
IPPS
2002
IEEE
13 years 10 months ago
On Cost-Optimal Merge of Two Intransitive Sorted Sequences
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
Jie Wu, Stephan Olariu
INFOCOM
2009
IEEE
13 years 12 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...
BIRTHDAY
2003
Springer
13 years 10 months ago
Sweepline the Music!
Abstract. The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of...
Esko Ukkonen, Kjell Lemström, Veli Mäkin...