Sciweavers

153 search results - page 25 / 31
» Efficient top-k processing over query-dependent functions
Sort
View
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
14 years 1 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
TASLP
2010
167views more  TASLP 2010»
13 years 2 months ago
Broadband Source Localization From an Eigenanalysis Perspective
Abstract--Broadband source localization has several applications ranging from automatic video camera steering to target signal tracking and enhancement through beamforming. Consequ...
Mehrez Souden, Jacob Benesty, Sofiène Affes
CVPR
2007
IEEE
14 years 9 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman
KDD
2004
ACM
143views Data Mining» more  KDD 2004»
14 years 7 months ago
Incremental maintenance of quotient cube for median
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wan...
COMPGEOM
2006
ACM
13 years 11 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi