Sciweavers

231 search results - page 35 / 47
» Improvements to combinational equivalence checking
Sort
View
TIP
2010
119views more  TIP 2010»
13 years 2 months ago
Software Designs of Image Processing Tasks With Incremental Refinement of Computation
Software realizations of computationally-demanding image processing tasks (e.g. image transforms and convolution) do not currently provide graceful degradation when their clock-cy...
Davide Anastasia, Yiannis Andreopoulos
DAM
2008
115views more  DAM 2008»
13 years 8 months ago
Variable space search for graph coloring
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey
JCO
2007
128views more  JCO 2007»
13 years 7 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
OSDI
2008
ACM
14 years 8 months ago
SQCK: A Declarative File System Checker
The lowly state of the art for file system checking and repair does not match what is needed to keep important data available for users. Current file system checkers, such as e2fs...
Haryadi S. Gunawi, Abhishek Rajimwale, Andrea C. A...
DSN
2005
IEEE
14 years 1 months ago
Neutralization of Errors and Attacks in Wireless Ad Hoc Networks
This paper proposes and evaluates strategies to build reliable and secure wireless ad hoc networks. Our contribution is based on the notion of inner-circle consistency, where loca...
Claudio Basile, Zbigniew Kalbarczyk, Ravishankar K...