Sciweavers

1210 search results - page 217 / 242
» Newton's method and its use in optimization
Sort
View
CGF
2010
157views more  CGF 2010»
13 years 5 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
VLDB
2008
ACM
110views Database» more  VLDB 2008»
14 years 7 months ago
Enhancing histograms by tree-like bucket indices
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
Francesco Buccafurri, Gianluca Lax, Domenico Sacc...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
SIGIR
2005
ACM
14 years 1 months ago
Orthogonal locality preserving indexing
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He
IJCAI
1997
13 years 9 months ago
Combining Probabilistic Population Codes
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
Richard S. Zemel, Peter Dayan