Sciweavers

556 search results - page 23 / 112
» A Comparative Study of Some Generalized Rough Approximations
Sort
View
108
Voted
ISSAC
2009
Springer
184views Mathematics» more  ISSAC 2009»
15 years 8 months ago
An iterative method for calculating approximate GCD of univariate polynomials
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
Akira Terui
LION
2007
Springer
198views Optimization» more  LION 2007»
15 years 8 months ago
Multiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
Deon Garrett, Dipankar Dasgupta
MM
2003
ACM
143views Multimedia» more  MM 2003»
15 years 7 months ago
Approximate matching algorithms for music information retrieval using vocal input
Effective use of multimedia collections requires efficient and intuitive methods of searching and browsing. This work considers databases which store music and explores how these...
Richard L. Kline, Ephraim P. Glinert
135
Voted
CORR
2012
Springer
218views Education» more  CORR 2012»
13 years 9 months ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
15 years 7 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...