Sciweavers

725 search results - page 22 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 2 days ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
108
Voted
JCP
2007
143views more  JCP 2007»
14 years 9 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
AAAI
2012
13 years 21 hour ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
75
Voted
ISLPED
2005
ACM
96views Hardware» more  ISLPED 2005»
15 years 3 months ago
Region-level approximate computation reuse for power reduction in multimedia applications
ABSTRACT Motivated by data value locality and quality tolerance present in multimedia applications, we propose a new micro-architecture, Region-level Approximate Computation Buffer...
Xueqi Cheng, Michael S. Hsiao
SAC
2004
ACM
15 years 3 months ago
GD-GhOST: a goal-oriented self-tuning caching algorithm
A popular solution to internet performance problems is the widespread caching of data. Many caching algorithms have been proposed in the literature, most attempting to optimize fo...
Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chry...