Sciweavers

5995 search results - page 381 / 1199
» Algorithmic Game Theory
Sort
View
IJIS
2007
94views more  IJIS 2007»
15 years 6 months ago
The eightfold way of deliberation dialogue
Deliberation dialogues occur when two or more participants seek to jointly agree an action or a course of action in some situation. We present the first formal framework for such...
Peter McBurney, David Hitchcock, Simon Parsons
PAMI
2007
113views more  PAMI 2007»
15 years 6 months ago
Dominant Sets and Pairwise Clustering
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
Massimiliano Pavan, Marcello Pelillo
ICASSP
2011
IEEE
14 years 10 months ago
Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks using the Nash Bargaining S
We consider the problem of resource allocation for a Direct Sequence Code Division Multiple Access (DS-CDMA) wireless visual sensor network (VSN). We use the Nash Bargaining Solut...
Katerina Pandremmenou, Lisimachos P. Kondi, Konsta...
CVPR
2012
IEEE
13 years 9 months ago
A game-theoretic approach to deformable shape matching
We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment p...
Emanuele Rodolà, Alexander M. Bronstein, An...
SSDBM
2008
IEEE
95views Database» more  SSDBM 2008»
16 years 1 months ago
Finding Frequent Items over General Update Streams
Abstract. We present novel space and time-efficient algorithms for finding frequent items over general update streams. Our algorithms are based on a novel adaptation of the popula...
Sumit Ganguly, Abhayendra N. Singh, Satyam Shankar