198 search results - page 5 / 40 » Evidence-invariant Sensitivity Bounds |
CCCG
2007
13 years 9 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
ISOLA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
ICMLA
2009
13 years 5 months ago
2009
In sequential decision making under uncertainty, as in many other modeling endeavors, researchers observe a dynamical system and collect data measuring its behavior over time. The...
SIAMJO
2010
13 years 2 months ago
2010
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...
ICPP
2008
IEEE
14 years 2 months ago
2008
IEEE
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...