Sciweavers

2254 search results - page 354 / 451
» Computing the minimal covering set
Sort
View
FLAIRS
2008
15 years 8 months ago
State Space Compression with Predictive Representations
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
ECCV
2010
Springer
15 years 8 months ago
Descriptor Learning for Efficient Retrieval
Many visual search and matching systems represent images using sparse sets of "visual words": descriptors that have been quantized by assignment to the best-matching symb...
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
15 years 7 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
CIDR
2003
150views Algorithms» more  CIDR 2003»
15 years 7 months ago
The Database Machine: Old Story, New Slant?
Current database management system technology is not well equipped to provide adequate support for what has been deemed the 3rd wave of computing -- Ubiquitous Computing. Such app...
Julie A. McCann
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 7 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell