1101 search results - page 186 / 221 » An Algorithm for the Graph Crossing Number Problem |
120
click to vote
FPGA
2007
ACM
15 years 8 months ago
2007
ACM
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high ...
121
Voted
TIP
1998
15 years 1 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
135
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
191
click to vote
BVAI
2007
Springer
15 years 8 months ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
129
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...