Sciweavers

DAGSTUHL
2007
13 years 6 months ago
Approximating min-max k-clustering
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
Asaf Levin
CIKM
2006
Springer
13 years 8 months ago
Optimisation methods for ranking functions with multiple parameters
Optimising the parameters of ranking functions with respect to standard IR rank-dependent cost functions has eluded satisfactory analytical treatment. We build on recent advances ...
Michael J. Taylor, Hugo Zaragoza, Nick Craswell, S...
ICA
2007
Springer
13 years 8 months ago
Phase-Aware Non-negative Spectrogram Factorization
Non-negative spectrogram factorization has been proposed for single-channel source separation tasks. These methods operate on the magnitude or power spectrogram of the input mixtur...
R. Mitchell Parry, Irfan A. Essa
INFOCOM
1997
IEEE
13 years 8 months ago
VBR over VBR: The Homogeneous, Loss-Free Case
We consider the multiplexing of several variable bit rate (VBR) connections over one variable bit rate connection where the multiplexing uses a multiplexing bu er of size B. The V...
Silvia Giordano, Jean-Yves Le Boudec, Philippe Oec...
ACISP
2000
Springer
13 years 9 months ago
Two-Stage Optimisation in the Design of Boolean Functions
This paper shows how suitable choice of cost function can significantly affect the power of optimisation methods for the synthesising of Boolean functions. In particular we show ...
John A. Clark, Jeremy Jacob
CVPR
2000
IEEE
13 years 9 months ago
Geodesic Distance Evolution of Surfaces: A New Method for Matching Surfaces
The general problem of surface matching is taken up in this study. The process described in this work hinges on a geodesic distance equation for a family of surfaces embedded in t...
Hussein M. Yahia, Etienne G. Huot, Isabelle Herlin...
EMMCVPR
2001
Springer
13 years 9 months ago
Path Based Pairwise Data Clustering with Application to Texture Segmentation
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
Bernd Fischer, Thomas Zöller, Joachim M. Buhm...
ICALP
2010
Springer
13 years 9 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
SIGECOM
2010
ACM
149views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
A new understanding of prediction markets via no-regret learning
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
Yiling Chen, Jennifer Wortman Vaughan
ICPR
2002
IEEE
13 years 9 months ago
Image Segmentation Using Curve Evolution and Region Stability
A novel scheme for image segmentation is presented. An image segmentation criterion is proposed that gathers similar pixels together to form regions and creates boundaries between...
Baris Sumengen, B. S. Manjunath, Charles S. Kenney