221 search results - page 8 / 45 » Efficient sampling of random permutations |
KDD
2009
ACM
14 years 9 months ago
2009
ACM
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
VLSISP
2008
13 years 9 months ago
2008
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
EDBT
2010
ACM
14 years 11 days ago
2010
ACM
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...