Sciweavers

7129 search results - page 250 / 1426
» Approximation Algorithms for Treewidth
Sort
View
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 7 months ago
Filter approximation using explicit time and frequency domain specifications
We demonstrate that enhanced particle swarm optimization (PSO) can be successfully used to evolve high performance filter approximations. These evolved approximations use sets of ...
Varun Aggarwal, Wesley O. Jin, Una-May O'Reilly
131
Voted
AAECC
1995
Springer
137views Algorithms» more  AAECC 1995»
15 years 7 months ago
About Approximations of Exponentials
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
Pierre-Vincent Koseleff
CVPR
2010
IEEE
16 years 9 days ago
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...
ICDM
2007
IEEE
106views Data Mining» more  ICDM 2007»
15 years 10 months ago
High-Speed Function Approximation
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
Biswanath Panda, Mirek Riedewald, Johannes Gehrke,...
SOFSEM
2007
Springer
15 years 10 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach