1629 search results - page 248 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
JOC
2000
14 years 9 months ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
100
click to vote
DAC
2010
ACM
14 years 10 months ago
2010
ACM
The performance of most embedded systems is critically dependent on the average memory access latency. Improving the cache hit rate can have significant positive impact on the per...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
117
click to vote
CVPR
2008
IEEE
15 years 12 months ago
2008
IEEE
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm ...
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Foreground and background segmentation is a typical problem in computer vision and medical imaging. In this paper, we propose a new learning based approach for 3D segment...