Sciweavers

8667 search results - page 1608 / 1734
» The information discovery framework
Sort
View
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
16 years 6 months ago
Transforming data to satisfy privacy constraints
Data on individuals and entities are being collected widely. These data can contain information that explicitly identifies the individual (e.g., social security number). Data can ...
Vijay S. Iyengar
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
16 years 6 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 6 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 6 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 6 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
« Prev « First page 1608 / 1734 Last » Next »