Sciweavers

10901 search results - page 146 / 2181
» Approximations in Distributed Optimization
Sort
View
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
16 years 6 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das
PODS
2002
ACM
138views Database» more  PODS 2002»
16 years 6 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
DCOSS
2009
Springer
16 years 1 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
IPPS
2007
IEEE
16 years 22 days ago
Link Shutdown Opportunities During Collective Communications in 3-D Torus Nets
As modern computing clusters used in scientific computing applications scale to ever-larger sizes and capabilities, their operational energy costs have become prohibitive. While ...
S. Conner, Sayaka Akioka, Mary Jane Irwin, Padma R...
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 6 months ago
Statistical Compressive Sensing of Gaussian Mixture Models
A new framework of compressive sensing (CS), namely statistical compressive sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical dist...
Guoshen Yu, Guillermo Sapiro