Sciweavers

32 search results - page 4 / 7
» Path coupling without contraction
Sort
View
STEP
2005
IEEE
14 years 1 months ago
Using Metamodels in Service Interoperability
Interoperability in service oriented environments is heavily inuenced by the view that the cooperating services have on their data. e term service for the abstract contract concl...
Andreas Winter, Jürgen Ebert
POPL
2003
ACM
14 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
IMC
2003
ACM
14 years 20 days ago
A measurement study of available bandwidth estimation tools
Available bandwidth estimation is useful for route selection in overlay networks, QoS verification, and traffic engineering. Recent years have seen a surge in interest in availab...
Jacob Strauss, Dina Katabi, M. Frans Kaashoek
SPAA
2003
ACM
14 years 19 days ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
GIS
2002
ACM
13 years 7 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...