275 search results - page 30 / 55 » On the computational power of iterative auctions |
128
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, a novel hierarchical clustering method using link analysis techniques is introduced. The algorithm is formulated as an authority seeking procedure on graphs, which c...
ACMDIS
1997
ACM
15 years 1 months ago
1997
ACM
This paper presents the design of a new form of computer interface that uses physical objects to embody digital information, providing a means for interacting with data. Triangles...
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
ICDCS
2005
IEEE
15 years 3 months ago
2005
IEEE
The lack of a flexible consistency management solution hinders P2P implementation of applications involving updates, such as read-write file sharing, directory services, online ...
72
Voted
PLDI
2010
ACM
15 years 7 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...