446 search results - page 24 / 90 » A Combinatorial Theorem for Trees |
114
click to vote
FC
2009
Springer
15 years 8 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
121
Voted
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
132
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
129
Voted
GRAMMARS
2000
15 years 1 months ago
2000
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
131
click to vote
PPSN
2010
Springer
15 years 7 days ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...