Sciweavers

512 search results - page 61 / 103
» Reducibility among equilibrium problems
Sort
View
COMGEO
2006
ACM
13 years 9 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
14 years 9 months ago
Adaptive location constraint processing
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
Zhengdao Xu, Hans-Arno Jacobsen
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
14 years 4 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He
ICS
1999
Tsinghua U.
14 years 1 months ago
Realizing the performance potential of the virtual interface architecture
The Virtual Interface (VI) Architecture provides protected userlevel communication with high delivered bandwidth and low permessage latency, particularly for small messages. The V...
Evan Speight, Hazim Abdel-Shafi, John K. Bennett
INFOCOM
1998
IEEE
14 years 1 months ago
TCP Fast Recovery Strategies: Analysis and Improvements
This paper suggests that, to match an ideal Internet gateway which rigorously enforces fair sharing among competing TCP connections, an ideal TCP sender should possess two propert...
Dong Lin, H. T. Kung