2168 search results - page 92 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
172
Voted
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
Todays, we assist to the explosive development of mobile computing devices like PDAs and cell-phones, the integration of embedded intelligence (like Web server) in more and more c...
154
Voted
PG
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
159
Voted
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
141
Voted
SAC
2009
ACM
15 years 10 months ago
2009
ACM
The prediction of the correct secondary structures of large RNAs is one of the unsolved challenges of computational molecular biology. Among the major obstacles is the fact that a...
131
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...