Sciweavers

1142 search results - page 91 / 229
» Approximability of Clausal Constraints
Sort
View
RTAS
2006
IEEE
16 years 12 days ago
Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
Sathish Gopalakrishnan, Marco Caccamo
ICES
2003
Springer
151views Hardware» more  ICES 2003»
15 years 11 months ago
Using Genetic Programming and High Level Synthesis to Design Optimized Datapath
This paper presents a methodology to design optimized electronic systems from high abstraction level descriptions. The methodology uses Genetic Programming in addition to high-leve...
Sérgio G. Araújo, Antônio C. M...
RANDOM
2001
Springer
15 years 10 months ago
On Euclidean Embeddings and Bandwidth Minimization
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
John Dunagan, Santosh Vempala
BMVC
2000
15 years 7 months ago
Building Temporal Models for Gesture Recognition
This work presents a piecewise linear approximation to non-linear Point Distribution Models for modelling the human hand. The work utilises the natural segmentation of shape space...
Richard Bowden, Mansoor Sarhadi
ECCC
2006
75views more  ECCC 2006»
15 years 6 months ago
Note on MAX 2SAT
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...
Moses Charikar, Konstantin Makarychev, Yury Makary...