Sciweavers

1696 search results - page 217 / 340
» Permuted function matching
Sort
View
COMPGEOM
2000
ACM
15 years 7 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk
ISPD
1999
ACM
97views Hardware» more  ISPD 1999»
15 years 7 months ago
A methodology to analyze power, voltage drop and their effects on clock skew/delay in early stages of design
This paper presents a methodology to analyze signal integrity such as power voltage drop and clock skew in early stages of design, more specifically, when RTL-design and early flo...
Masato Iwabuchi, Noboru Sakamoto, Yasushi Sekine, ...
IPPS
1998
IEEE
15 years 7 months ago
SIMD and Mixed-Mode Implementations of a Visual Tracking Algorithm
This paper describes the implementation of a featurebased visual tracking algorithm on a SIMD MasPar MP-1 and the mixed-mode PASM prototype. The sequential algorithm is introduced...
Mark Bernd Kulaczewski, Howard Jay Siegel
SIGOPSE
1994
ACM
15 years 7 months ago
SPIN - An Extensible Microkernel for Application-specific Operating System Services
Application domains, such as multimedia, databases, and parallel computing, require operating system services with high performance and high functionality. Existing operating syst...
Brian N. Bershad, Craig Chambers, Susan J. Eggers,...
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
15 years 6 months ago
Using convex hulls to represent classifier conditions
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
Pier Luca Lanzi, Stewart W. Wilson