2168 search results - page 234 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
176
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
Though implicit representations of surfaces have often been used for various computer graphics tasks like modeling and morphing of objects, it has rarely been used for registratio...
293
click to vote
NLP
2000
15 years 10 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
171
click to vote
EVOW
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. This work describes an evolutionary approach to texture segmentation, a long-standing and important problem in computer vision. The difficulty of the problem can be relat...
183
click to vote
SAC
2006
ACM
16 years 12 days ago
2006
ACM
Dynamic languages typically allow programs to be written y high level of abstraction. But their dynamic nature makes it very hard to compile such languages, meaning that a price h...
173
click to vote
ICDCS
2008
IEEE
16 years 27 days ago
2008
IEEE
We introduce a Write-Once Read-Many (WORM) storage system providing strong assurances of data retention and compliant migration, by leveraging trusted secure hardware in close dat...