530 search results - page 53 / 106 » Universal randomized switching |
127
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
116
click to vote
DNA
2001
Springer
15 years 8 months ago
2001
Springer
In the universal DNA chip method, target RNAs are mapped onto a set of DNA tags. Parallel hybridization of these tags with an indexed, complementary antitag array then provides an ...
173
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We propose a novel hashing scheme for image retrieval,
clustering and automatic object discovery. Unlike commonly
used bag-of-words approaches, the spatial extent of
image featu...
142
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
229
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...