Sciweavers

1105 search results - page 161 / 221
» Linear choosability of graphs
Sort
View
DFT
2005
IEEE
83views VLSI» more  DFT 2005»
15 years 5 months ago
An ILP Formulation for Yield-driven Architectural Synthesis
Data flow graph dominant designs, such as communication video and audio applications, are common in today’s IC industry. In these designs, the datapath resources (e.g., adders,...
Zhaojun Wo, Israel Koren, Maciej J. Ciesielski
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
15 years 5 months ago
Human Posture Recognition with Convex Programming
We present a novel human posture recognition method using convex programming based matching schemes. Instead of trying to segment the object from the background, we develop a nove...
Hao Jiang, Ze-Nian Li, Mark S. Drew
ISPDC
2005
IEEE
15 years 5 months ago
A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
Gabriel Paillard, Christian Antoine Louis Lavault,...
CSCLP
2004
Springer
15 years 5 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
LICS
2003
IEEE
15 years 5 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska