Sciweavers

5785 search results - page 157 / 1157
» Approximability of Probability Distributions
Sort
View
150
Voted
TKDE
2010
184views more  TKDE 2010»
15 years 2 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
136
Voted
FOCS
1992
IEEE
15 years 7 months ago
Proof Verification and Hardness of Approximation Problems
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...
129
Voted
JCAM
2011
69views more  JCAM 2011»
14 years 6 months ago
Comonotonic approximations for a generalized provisioning problem with application to optimal portfolio selection
In this paper we discuss multiperiod portfolio selection problems related to a speci…c provisioning problem. Our results are an extension of Dhaene et al. (2005), where optimal ...
Koen Van Weert, Jan Dhaene, Marc J. Goovaerts
112
Voted
PAMI
2008
134views more  PAMI 2008»
15 years 3 months ago
Bittracker - A Bitmap Tracker for Visual Tracking under Very General Conditions
This paper addresses the problem of visual tracking under very general conditions: a possibly nonrigid target whose appearance may drastically change over time, general camera moti...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin
124
Voted
BMCBI
2010
113views more  BMCBI 2010»
15 years 3 months ago
Statistical method on nonrandom clustering with application to somatic mutations in cancer
Background: Human cancer is caused by the accumulation of tumor-specific mutations in oncogenes and tumor suppressors that confer a selective growth advantage to cells. As a conse...
Jingjing Ye, Adam Pavlícek, Elizabeth A. Lu...