4377 search results - page 169 / 876 » Mass problems and randomness |
150
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
136
click to vote
ICIP
2008
IEEE
16 years 29 days ago
2008
IEEE
We consider the problem of establishing visual correspondences in a distributed and rate-efficient fashion by broadcasting compact descriptors. Establishing visual correspondence...
243
click to vote
ICDAR
2007
IEEE
16 years 26 days ago
2007
IEEE
The paper describes a lexicon driven approach for word recognition on handwritten documents using Conditional Random Fields(CRFs). CRFs are discriminative models and do not make a...
166
click to vote
IJCNN
2007
IEEE
16 years 25 days ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
138
click to vote
ICCS
2007
Springer
16 years 21 days ago
2007
Springer
When wireless senor networks (WSNs) are deployed in hostile areas, they indeed need to be secured by security mechanisms. To do this, cryptographic keys must be agreed on by commun...