Sciweavers

1787 search results - page 101 / 358
» Approximation Techniques for Spatial Data
Sort
View
FSTTCS
2006
Springer
14 years 18 days ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
POPL
2007
ACM
14 years 9 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
TNN
2010
176views Management» more  TNN 2010»
13 years 3 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
PVLDB
2010
184views more  PVLDB 2010»
13 years 7 months ago
TimeTrails: A System for Exploring Spatio-Temporal Information in Documents
Spatial and temporal data have become ubiquitous in many application domains such as the Geosciences or life sciences. Sophisticated database management systems are employed to ma...
Jannik Strötgen, Michael Gertz
ICML
2005
IEEE
14 years 9 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