Sciweavers

8431 search results - page 366 / 1687
» Algorithmically Independent Sequences
Sort
View
163
Voted
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 9 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
ICIP
2004
IEEE
16 years 8 months ago
Simultaneous background and foreground modeling for tracking in surveillance video
We present a stochastic tracking algorithm for surveillance video where targets are dim and at low resolution. The algorithm builds motion models for both background and foregroun...
Jie Shao, Shaohua Kevin Zhou, Rama Chellappa
ESWS
2008
Springer
15 years 8 months ago
Graph Summaries for Subgraph Frequency Estimation
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Pau...
IJCAI
2007
15 years 8 months ago
Estimating the Rate of Web Page Updates
Estimating the rate of Web page updates helps in improving the Web crawler’s scheduling policy. But, most of the Web sources are autonomous and updated independently. Clients li...
Sanasam Ranbir Singh
NIPS
2008
15 years 8 months ago
Efficient Inference in Phylogenetic InDel Trees
Accurate and efficient inference in evolutionary trees is a central problem in computational biology. While classical treatments have made unrealistic site independence assumption...
Alexandre Bouchard-Côté, Michael I. J...