446 search results - page 24 / 90 » A Combinatorial Theorem for Trees |
160
click to vote
FC
2009
Springer
16 years 19 days 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...
165
click to vote
FSTTCS
2010
Springer
15 years 4 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...
169
click to vote
IPPS
2007
IEEE
16 years 11 days 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...
174
click to vote
GRAMMARS
2000
15 years 5 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 ...
177
click to vote
PPSN
2010
Springer
15 years 4 months 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 ...