Sciweavers

4843 search results - page 269 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
116
Voted
RANDOM
1998
Springer
15 years 8 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
222
Voted
VLDB
2005
ACM
109views Database» more  VLDB 2005»
16 years 4 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
120
Voted
SIGIR
2009
ACM
15 years 10 months ago
Approximating true relevance distribution from a mixture model based on irrelevance data
Pseudo relevance feedback (PRF), which has been widely applied in IR, aims to derive a distribution from the top n pseudo relevant documents D. However, these documents are often ...
Peng Zhang, Yuexian Hou, Dawei Song
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
15 years 10 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
134
Voted
IWANN
1999
Springer
15 years 8 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson