Sciweavers

1994 search results - page 115 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
SIGSOFT
2005
ACM
15 years 10 months ago
Matching execution histories of program versions
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
Xiangyu Zhang, Rajiv Gupta
SIGCOMM
1999
ACM
15 years 2 months ago
Load-Sensitive Routing of Long-Lived IP Flows
Internet service providers face a daunting challenge in provisioning network resources, due to the rapid growth of the Internet and wide fluctuations in the underlying traffic pa...
Anees Shaikh, Jennifer Rexford, Kang G. Shin
SPIESR
1998
151views Database» more  SPIESR 1998»
14 years 11 months ago
Synthesizing Parallel Imaging Applications Using the CAP Computer-Aided Parallelization Tool
Abstract. Imaging applications such as filtering, image transforms and compression/decompression require vast amounts of computing power when applied to large data sets. These appl...
Benoit A. Gennart, Marc Mazzariol, Vincent Messerl...
TRANSCI
2010
101views more  TRANSCI 2010»
14 years 8 months ago
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
Sumit Kunnumkal, Huseyin Topaloglu
SAC
2008
ACM
14 years 9 months ago
Improving denial of service resistance using dynamic local adaptations
We improve the resistance of gossip-based multicast to (Distributed) Denial of Service (DoS) attacks using dynamic local adaptations at each node. Each node estimates the current ...
Gal Badishi, Idit Keidar