Sciweavers

105 search results - page 10 / 21
» Almost Optimal Solutions to k-Clustering Problems
Sort
View
63
Voted
ECCV
2008
Springer
15 years 11 months ago
Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles
This paper presents a new MRF optimization algorithm, which is derived from Linear Programming and manages to go beyond current state-of-the-art techniques (such as those based on ...
Nikos Komodakis, Nikos Paragios
TWC
2010
14 years 4 months ago
Relay selection and power allocation in cooperative cellular networks
We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sugge...
Sachin Kadloor, Raviraj Adve
ICDCS
1998
IEEE
15 years 1 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
14 years 11 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
IDEAS
2005
IEEE
101views Database» more  IDEAS 2005»
15 years 3 months ago
Rewriting-Based Optimization for XQuery Transformational Queries
The modern XML query language called XQuery includes advanced facilities both to query and to transform XML data. An XQuery query optimizer should be able to optimize any query. F...
Maxim Grinev, Peter Pleshachkov