Sciweavers

2168 search results - page 96 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 8 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
SIGIR
2005
ACM
15 years 8 months ago
A Markov random field model for term dependencies
This paper develops a general, formal framework for modeling term dependencies via Markov random fields. The model allows for arbitrary text features to be incorporated as eviden...
Donald Metzler, W. Bruce Croft
ECCV
2010
Springer
15 years 8 months ago
Randomized Locality Sensitive Vocabularies for Bag-of-Features Model
Abstract. Visual vocabulary construction is an integral part of the popular Bag-of-Features (BOF) model. When visual data scale up (in terms of the dimensionality of features or/an...
ICASSP
2011
IEEE
14 years 6 months ago
Snapshot spectral imaging via compressive random convolution
Spectral imaging is of interest in many applications, including wide-area airborne surveillance, remote sensing, and tissue spectroscopy. Coded aperture spectral snapshot imaging ...
Yao Wu, Gonzalo R. Arce
IPTPS
2003
Springer
15 years 8 months ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder