Sciweavers

1632 search results - page 256 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
136
Voted
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 3 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CEC
2010
IEEE
15 years 4 months ago
Constrained global optimization of low-thrust interplanetary trajectories
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...
Chit Hong Yam, David Di Lorenzo, Dario Izzo
133
Voted
ICCV
2003
IEEE
16 years 5 months ago
Improved Fast Gauss Transform and Efficient Kernel Density Estimation
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimatio...
Changjiang Yang, Ramani Duraiswami, Nail A. Gumero...
126
Voted
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
15 years 5 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
128
Voted
JSS
2007
88views more  JSS 2007»
15 years 3 months ago
SQUIRE: Sequential pattern mining with quantities
Discovering sequential patterns is an important problem for many applications. Existing algorithms find qualitative sequential patterns in the sense that only items are included ...
Chulyun Kim, Jong-Hwa Lim, Raymond T. Ng, Kyuseok ...