5100 search results - page 666 / 1020 » The Linear Complexity of a Graph |
168
click to vote
SIGSOFT
2006
ACM
16 years 7 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
162
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
172
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
197
click to vote
CGO
2009
IEEE
16 years 1 months ago
2009
IEEE
—The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. This model allows programmers to sp...
196
click to vote
MSWIM
2009
ACM
16 years 1 months ago
2009
ACM
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...