Sciweavers

5055 search results - page 624 / 1011
» Relative Timing
Sort
View
VLSID
2005
IEEE
128views VLSI» more  VLSID 2005»
16 years 7 months ago
On-Line Synthesis for Partially Reconfigurable FPGAs
An important application of dynamically and partially reconfigurable computing platforms is in dynamic task allocation and execution. On-line synthesis, on-line placement and on-l...
Renqiu Huang, Ranga Vemuri
CHI
2004
ACM
16 years 7 months ago
"Stuff goes into the computer and doesn't come out": a cross-tool study of personal information management
This paper reports a study of Personal Information Management (PIM), which advances research in two ways: (1) rather than focusing on one tool, we collected cross-tool data relati...
Richard Boardman, Martina Angela Sasse
RECOMB
2006
Springer
16 years 7 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 7 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
16 years 7 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera