Sciweavers

3220 search results - page 562 / 644
» Constrained Graph Processes
Sort
View
VLSID
2002
IEEE
136views VLSI» more  VLSID 2002»
16 years 6 months ago
Buffered Routing Tree Construction under Buffer Placement Blockages
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
Wei Chen, Massoud Pedram, Premal Buch
VLDB
2007
ACM
114views Database» more  VLDB 2007»
16 years 6 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
PODS
2005
ACM
131views Database» more  PODS 2005»
16 years 6 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
MOBISYS
2006
ACM
16 years 5 months ago
Building realistic mobility models from coarse-grained traces
In this paper we present a trace-driven framework capable of building realistic mobility models for the simulation studies of mobile systems. With the goal of realism, this framew...
Jungkeun Yoon, Brian D. Noble, Mingyan Liu, Minkyo...
WISE
2009
Springer
16 years 3 months ago
Formal Identification of Right-Grained Services for Service-Oriented Modeling
Identifying the right-grained services is important to lead the successful service orientation because it has a direct impact on two major goals: the composability of loosely-coupl...
Yukyong Kim, Kyung-Goo Doh