934 search results - page 80 / 187 » A theoretical analysis of the HIFF problem |
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
179
click to vote
AIPRF
2008
14 years 11 months ago
2008
Despite outstanding successes of the state-of-the-art clustering algorithms, many of them still suffer from shortcomings. Mainly, these algorithms do not capture coherency and homo...
MOBICOM
2012
ACM
13 years 10 days ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
Modelling textured images as AM-FM functions has been applied during the last years to texture analysis and segmentation tasks. In this paper we present some advances in two direc...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...