459 search results - page 84 / 92 » Computational Complexity of Probabilistic Disambiguation |
134
click to vote
IPSN
2007
Springer
15 years 5 months ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
106
click to vote
ICPP
2006
IEEE
15 years 5 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
202
click to vote
TCSV
2011
14 years 6 months ago
2011
—We present in this paper an integrated solution to rapidly recognizing dynamic objects in surveillance videos by exploring various contextual information. This solution consists...
123
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...
132
Voted
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...