Sciweavers

3874 search results - page 412 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
15 years 6 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist
IJFCS
2006
87views more  IJFCS 2006»
15 years 6 months ago
Flexible Music Retrieval in Sublinear Time
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 6 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 7 months ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos
ICCV
2005
IEEE
16 years 9 days ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua