Sciweavers

103 search results - page 11 / 21
» Online Maintenance of Very Large Random Samples
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 7 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
DRR
2010
13 years 10 months ago
Time and space optimization of document content classifiers
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...
Dawei Yin, Henry S. Baird, Chang An
ICCV
2007
IEEE
14 years 9 months ago
Gradient Feature Selection for Online Boosting
Boosting has been widely applied in computer vision, especially after Viola and Jones's seminal work [23]. The marriage of rectangular features and integral-imageenabled fast...
Ting Yu, Xiaoming Liu 0002
CC
2002
Springer
117views System Software» more  CC 2002»
13 years 7 months ago
Online Subpath Profiling
We present an efficient online subpath profiling algorithm, OSP, that reports hot subpaths executed by a program in a given run. The hot subpaths can start at arbitrary basic block...
David Oren, Yossi Matias, Shmuel Sagiv
BMCBI
2004
143views more  BMCBI 2004»
13 years 7 months ago
Comparing functional annotation analyses with Catmap
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
Thomas Breslin, Patrik Edén, Morten Krogh