3405 search results - page 110 / 681 » Factoring Groups Efficiently |
183
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile a...
149
click to vote
IEICET
2006
15 years 6 months ago
2006
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
194
click to vote
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
163
click to vote
CSCW
2012
ACM
14 years 2 months ago
2012
ACM
The management of group context in socially mediating technologies is an important challenge for the design community. To better understand how users manage group context, we expl...
262
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...