Sciweavers

2745 search results - page 128 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
143
Voted
SIGMOD
1998
ACM
121views Database» more  SIGMOD 1998»
15 years 8 months ago
New Sampling-Based Summary Statistics for Improving Approximate Query Answers
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
Phillip B. Gibbons, Yossi Matias
127
Voted
CSDA
2008
94views more  CSDA 2008»
15 years 3 months ago
Robust model selection using fast and robust bootstrap
Robust model selection procedures control the undue influence that outliers can have on the selection criteria by using both robust point estimators and a bounded loss function wh...
Matias Salibian-Barrera, Stefan Van Aelst
139
Voted
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 4 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
MOBIHOC
2012
ACM
13 years 6 months ago
EV-Loc: integrating electronic and visual signals for accurate localization
Nowadays, an increasing number of objects can be represented by their wireless electronic identifiers. For example, people can be recognized by their phone numbers or their phone...
Boying Zhang, Jin Teng, Junda Zhu, Xinfeng Li, Don...
128
Voted
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
15 years 8 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose