402 search results - page 47 / 81 » Cryptosystems using Linear Groups |
134
click to vote
SSDBM
2003
IEEE
15 years 7 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
120
click to vote
IBPRIA
2003
Springer
15 years 7 months ago
2003
Springer
We describe a technique for extracting vertices from range images of cluttered box-like objects. Edge detection is performed and an edge map is acquired. Extraction of vertices is ...
118
click to vote
PRL
2008
15 years 1 months ago
2008
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
130
click to vote
IJCAI
2007
15 years 3 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
105
click to vote
MMMACNS
2005
Springer
15 years 7 months ago
2005
Springer
The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n-1) dimensional ‘Markov type’ Lie group that is defined by preserving the ...