Sciweavers

1414 search results - page 52 / 283
» Randomness and Universal Machines
Sort
View
DCC
2007
IEEE
14 years 8 months ago
Quantization of Sparse Representations
Compressive sensing (CS) is a new signal acquisition technique for sparse and compressible signals. Rather than uniformly sampling the signal, CS computes inner products with rand...
Petros Boufounos, Richard G. Baraniuk
SEMWEB
2004
Springer
14 years 2 months ago
METEOR-S Web Service Annotation Framework with Machine Learning Classification
Researchers have recognized the need for more expressive descriptions of Web services. Most approaches have suggested using ontologies to either describe the Web services or to an...
Nicole Oldham, Christopher Thomas, Amit P. Sheth, ...
ISWC
1997
IEEE
14 years 27 days ago
A Touring Machine: Prototyping 3D Mobile Augmented Reality Systems for Exploring the Urban Environment
We describe a prototype system that combines together the overlaid 3D graphics of augmented reality with the untethered freedom of mobile computing. The goal is to explore how the...
Steven Feiner, Blair MacIntyre, Tobias Höller...
ICCPOL
2009
Springer
13 years 6 months ago
A Simple and Efficient Model Pruning Method for Conditional Random Fields
Conditional random fields (CRFs) have been quite successful in various machine learning tasks. However, as larger and larger data become acceptable for the current computational ma...
Hai Zhao, Chunyu Kit
ICALP
2007
Springer
14 years 2 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle