Sciweavers

2520 search results - page 60 / 504
» The complexity of approximating entropy
Sort
View
ICML
2005
IEEE
15 years 11 months ago
Near-optimal sensor placements in Gaussian processes
When monitoring spatial phenomena, which are often modeled as Gaussian Processes (GPs), choosing sensor locations is a fundamental task. A common strategy is to place sensors at t...
Carlos Guestrin, Andreas Krause, Ajit Paul Singh
IWANN
2005
Springer
15 years 3 months ago
Load Forecasting Using Fixed-Size Least Squares Support Vector Machines
Based on the Nystr¨om approximation and the primal-dual formulation of Least Squares Support Vector Machines (LS-SVM), it becomes possible to apply a nonlinear model to a large sc...
Marcelo Espinoza, Johan A. K. Suykens, Bart De Moo...
ICDIM
2008
IEEE
15 years 4 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
CORR
2010
Springer
155views Education» more  CORR 2010»
14 years 5 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
15 years 10 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...