2168 search results - page 74 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
114
Voted
IPSN
2007
Springer
15 years 9 months ago
2007
Springer
Distributed computation of Voronoi cells in sensor networks, i.e. computing the locus of points in a sensor field closest to a given sensor, is a key building block that supports...
104
Voted
CG
2002
Springer
15 years 3 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
221
click to vote
VLDB
2008
ACM
16 years 3 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
166
Voted
CSDA
2011
14 years 10 months ago
2011
Motivated by the application of seismic inversion in the petroleum industry we consider a hidden Markov model with two hidden layers. The bottom layer is a Markov chain and given ...
151
Voted
JSC
2006
15 years 3 months ago
2006
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...