10414 search results - page 289 / 2083 » An efficient algorithm for Co-segmentation |
156
click to vote
LCN
2007
IEEE
16 years 25 days ago
2007
IEEE
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
164
click to vote
CF
2006
ACM
16 years 15 days ago
2006
ACM
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...
163
click to vote
ASPDAC
2004
ACM
15 years 12 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
150
click to vote
DNA
2004
Springer
15 years 12 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
182
click to vote
WISA
2004
Springer
15 years 12 months ago
2004
Springer
In implementing cryptographic algorithms on limited devices such as smart cards, speed and memory optimization had always been a challenge. With the advent of side channel attacks,...