1368 search results - page 68 / 274 » Generalized Rook Polynomials |
216
click to vote
IWPEC
2010
Springer
15 years 2 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
142
click to vote
JOC
2000
15 years 4 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
187
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
146
click to vote
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider the problem of Semi-supervised Learning (SSL) from general unlabeled data, which may contain irrelevant samples. Within the binary setting, our model manages to better...
168
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...