Sciweavers

1329 search results - page 90 / 266
» Randomly Sampling Molecules
Sort
View
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 10 months ago
Nonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
Ulas Ayaz, Holger Rauhut
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
14 years 3 months ago
Planning with Continuous Actions in Partially Observable Environments
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
Matthijs T. J. Spaan, Nikos A. Vlassis
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
14 years 11 months ago
Mining Search-Phrase Definitions from Item Descriptions
In this paper, we develop a model for representing term dependence based on Markov Random Fields and present an approach based on Markov Chain Monte Carlo technique for generating ...
Hung V. Nguyen, Hasan Davulcu
ISCC
2006
IEEE
112views Communications» more  ISCC 2006»
14 years 4 months ago
The Precision and Energetic Cost of Snapshot Estimates in Wireless Sensor Networks
— Even for a specific application, the design space of wireless sensor networks is enormous, and traditional disciplinary boundaries are disappearing in the search for efficien...
Paul G. Flikkema
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 10 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church