2127 search results - page 128 / 426 » Computing large matchings fast |
119
Voted
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
Automating the process of postmortem identification of deceased individuals based on dental characteristics is receiving increased attention. With the large number of victims enco...
126
click to vote
COLCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
In contrast to a large body of theoretical work on computer systems, distributed systems are not idealised constructions, unconstrained by physical world limitations. They must be...
123
click to vote
GW
2005
Springer
15 years 9 months ago
2005
Springer
In modern society there is an increasing demand to access, record and manipulate large amounts of information. This has inspired a new approach to thinking about and designing pers...
127
Voted
CONCURRENCY
1998
15 years 3 months ago
1998
We present a new fast and scalable matrix multiplication algorithm, called DIMMA Distribution-Independent Matrix Multiplication Algorithm , for block cyclic data distribution on ...
128
click to vote
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...