2168 search results - page 330 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
144
Voted
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
This paper presents a cooperative strategy between volumetric registration and segmentation. The segmentation method is based on the level set formalism. Starting from an initial ...
136
click to vote
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
The image of a curved, specular (mirror-like) surface is a distorted reflection of the environment. The goal of our work is to develop a framework for recovering general shape fr...
134
click to vote
NCA
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop...
151
click to vote
DAC
2010
ACM
15 years 7 months ago
2010
ACM
The level of security provided by digital rights management functions and cryptographic protocols depend heavily on the security of an embedded secret key. The current practice of...
131
Voted
TCOM
2010
15 years 2 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...