Sciweavers

400 search results - page 23 / 80
» Extended formulations in combinatorial optimization
Sort
View
MOBIHOC
2006
ACM
15 years 11 months ago
Algorithmic aspects of communication in ad-hoc networks with smart antennas
Smart antennas have gained significant importance in multihop wireless networks in recent years, because of their sophisticated signal processing capabilities that hold the potent...
Karthikeyan Sundaresan, Weizhao Wang, Stephan Eide...
RIDE
1998
IEEE
15 years 4 months ago
On Periodic Resource Scheduling for Continuous Media Databases
The Enhanced Pay-Per-View (EPPV) model for providing continuous-media services associates with each continuous-media clip a display frequency that depends on the clip's popula...
Minos N. Garofalakis, Banu Özden, Abraham Sil...
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 5 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 12 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 12 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...