Sciweavers

5752 search results - page 1123 / 1151
» Informative Labeling Schemes
Sort
View
SIGCOMM
1999
ACM
14 years 29 days ago
A Simple Approximation to Minimum-Delay Routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
Srinivas Vutukury, J. J. Garcia-Luna-Aceves
ICPADS
1998
IEEE
14 years 28 days ago
User-Defined Telecooperation Services
A user-defined telecooperation service (UTS) provides service elements for application-specific communication and cooperation processes as well as integrated means for the service...
Volker Gruhn, Peter Herrmann, Heiko Krumm
VISUALIZATION
1998
IEEE
14 years 28 days ago
Interactive out-of-core isosurface extraction
In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space req...
Yi-Jen Chiang, Cláudio T. Silva, William J....
ICCAD
1997
IEEE
69views Hardware» more  ICCAD 1997»
14 years 27 days ago
Speeding up technology-independent timing optimization by network partitioning
Technology-independenttimingoptimizationis animportantproblem in logic synthesis. Although many promising techniques have been proposed in the past, unfortunately they are quite s...
Rajat Aggarwal, Rajeev Murgai, Masahiro Fujita
SPAA
1997
ACM
14 years 26 days ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
« Prev « First page 1123 / 1151 Last » Next »