2398 search results - page 284 / 480 » Constraint Programming and Graph Algorithms |
196
Voted
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
173
Voted
PDP
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
162
click to vote
ASPDAC
1998
ACM
15 years 10 months ago
1998
ACM
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
163
click to vote
WSCG
2004
15 years 7 months ago
2004
This paper is about the visualization of positive data subject to positivity constraint. It presents an algorithm that produces a non-negative graph through scattered positive dat...
172
click to vote
COMCOM
1998
15 years 6 months ago
1998
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...