Sciweavers

3702 search results - page 320 / 741
» All Pairings Are in a Group
Sort
View
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 8 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
AAAI
2006
15 years 8 months ago
Learning Blocking Schemes for Record Linkage
Record linkage is the process of matching records across data sets that refer to the same entity. One issue within record linkage is determining which record pairs to consider, si...
Matthew Michelson, Craig A. Knoblock
ICISC
2004
147views Cryptology» more  ICISC 2004»
15 years 8 months ago
Batch Verifications with ID-Based Signatures
An identity (ID)-based signature scheme allows any pair of users to verify each other's signatures without exchanging public key certificates. With the advent of Bilinear maps...
HyoJin Yoon, Jung Hee Cheon, Yongdae Kim
ATAL
2010
Springer
15 years 8 months ago
Manipulation of copeland elections
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
AMC
2007
177views more  AMC 2007»
15 years 7 months ago
Quadratic stability and stabilization of switched dynamic systems with uncommensurate internal point delays
This paper deals with the quadratic stability and linear state-feedback and output-feedback stabilization of switched delayed linear dynamic systems with, in general, a finite nu...
Manuel de la Sen