3946 search results - page 447 / 790 » The computational complexity of choice sets |
162
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
196
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we propose an energy-efficient broadcast algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is...
213
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
160
click to vote
ACL
2010
15 years 4 months ago
2010
Word Sense Disambiguation remains one of the most complex problems facing computational linguists to date. In this paper we present a system that combines evidence from a monoling...
195
click to vote
BMVC
2010
15 years 4 months ago
2010
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...