Sciweavers

14548 search results - page 2590 / 2910
» The Optimal Path-Matching Problem
Sort
View
CHI
2007
ACM
16 years 7 months ago
An interface to support color blind computer users
A new method for adapting digital images so that they are suitable for color blind viewers is presented. In contrast to earlier automatic methods which formulate the problem of ad...
Luke Jefferson, Richard Harvey
VLSID
2003
IEEE
103views VLSI» more  VLSID 2003»
16 years 7 months ago
Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...
POPL
2005
ACM
16 years 7 months ago
From sequential programs to multi-tier applications by program transformation
Modern applications are designed in multiple tiers to separate concerns. Since each tier may run at a separate location, middleware is required to mediate access between tiers. Ho...
Matthias Neubauer, Peter Thiemann
RECOMB
2003
Springer
16 years 7 months ago
Designing seeds for similarity search in genomic DNA
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
Jeremy Buhler, Uri Keich, Yanni Sun
CADE
2006
Springer
16 years 7 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
« Prev « First page 2590 / 2910 Last » Next »