Sciweavers

1082 search results - page 208 / 217
» Stability of Locally Optimal Solutions
Sort
View
ICCV
2007
IEEE
16 years 5 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
228
Voted
ICC
2007
IEEE
288views Communications» more  ICC 2007»
15 years 10 months ago
Joint Channel State Based Random Access and Adaptive Modulation in Wireless LAN with Multi-Packet Reception
—Conventional 802.11 medium access control (MAC) characteristics. In particular, all of these designs adopted a protocols have been designed separately from the characteristics s...
Wei Lan Huang, Khaled Ben Letaief, Ying Jun Zhang
119
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
141
Voted
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 9 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
ICALP
2003
Springer
15 years 8 months ago
Anycasting in Adversarial Systems: Routing and Admission Control
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
Baruch Awerbuch, André Brinkmann, Christian...