Sciweavers

995 search results - page 60 / 199
» Wire-speed total order
Sort
View
CCCG
2010
15 years 1 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
JCT
1998
99views more  JCT 1998»
14 years 11 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu
APPROX
2006
Springer
109views Algorithms» more  APPROX 2006»
15 years 3 months ago
Dobrushin Conditions and Systematic Scan
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
ISCA
2007
IEEE
145views Hardware» more  ISCA 2007»
15 years 6 months ago
Mechanisms for store-wait-free multiprocessors
Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, prog...
Thomas F. Wenisch, Anastassia Ailamaki, Babak Fals...
ISBI
2004
IEEE
16 years 18 days ago
Speckle Reduction on Ultrasound Image by Variational Methods and Adaptive Lagrangian Multipliers
Ultrasound images are corrupted by a multiplicative noise, the speckle, which makes high level analysis difficult. Within each resolution cell a number of elementary scatterers re...
Arnaud Ogier, Pierre Hellier, Christian Barillot