1830 search results - page 257 / 366 » Workshop on Graph Computation Models |
175
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
147
click to vote
DAC
2006
ACM
16 years 6 months ago
2006
ACM
Since performance on FPGAs is dominated by the routing architecture rather than wirelength, we propose a new architecture-aware approach to initial FPGA placement that models the ...
142
click to vote
FOSSACS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
146
click to vote
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
151
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...