3656 search results - page 200 / 732 » Compact Location Problems |
157
click to vote
PKDD
2009
Springer
16 years 24 days ago
2009
Springer
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an eļ¬...
153
click to vote
ASAP
2008
IEEE
16 years 22 days ago
2008
IEEE
NTRU is a public-key cryptosystem based on the shortest vector problem in a lattice which is an alternative to RSA and ECC. This work presents a compact and low power NTRU design ...
130
click to vote
ICIP
2008
IEEE
16 years 21 days ago
2008
IEEE
We consider the problem of establishing visual correspondences in a distributed and rate-efļ¬cient fashion by broadcasting compact descriptors. Establishing visual correspondence...
177
click to vote
CAV
2007
Springer
16 years 13 days ago
2007
Springer
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
155
click to vote
MICAI
2007
Springer
16 years 11 days ago
2007
Springer
Previous work on context-speciļ¬c independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In th...