Sciweavers

179 search results - page 21 / 36
» On Approximating the Average Distance Between Points
Sort
View
ICTAI
2008
IEEE
15 years 6 months ago
The Performance of Approximating Ordinary Differential Equations by Neural Nets
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
Josef Fojdl, Rüdiger W. Brause
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
15 years 5 months ago
Separating Populations with Wide Data: A Spectral Analysis
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...
112
Voted
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 5 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
CIKM
2010
Springer
14 years 10 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
ESANN
2007
15 years 1 months ago
Agglomerative Independent Variable Group Analysis
Independent Variable Group Analysis (IVGA) is a method for grouping dependent variables together while keeping mutually independent or weakly dependent variables in separate group...
Antti Honkela, Jeremias Seppä, Esa Alhoniemi