Sciweavers

2031 search results - page 20 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
AMDO
2000
Springer
15 years 1 months ago
Matching a Human Walking Sequence with a VRML Synthetic Model
- In this paper we present a specific matching technique based on basic motor patterns between two image sequences taken from different view points and a VRML synthetic human model...
Jose Maria Buades Rubio, Ramon Mas, Francisco J. P...
COCOON
2008
Springer
14 years 11 months ago
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constrai
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
Hung Q. Ngo, Yang Wang 0014, Anh Le
83
Voted
WWW
2009
ACM
15 years 10 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
JCT
2008
53views more  JCT 2008»
14 years 9 months ago
A major index for matchings and set partitions
We introduce a statistic pmaj(P) for partitions of [n], and show that it is equidistributed with cr2, the number of 2-crossings, over all partitions of [n] with given sets of mini...
William Y. C. Chen, Ira M. Gessel, Catherine H. Ya...
CCS
2008
ACM
14 years 11 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki