Sciweavers

1686 search results - page 320 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ASIACRYPT
2008
Springer
14 years 28 days ago
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...
ATAL
2008
Springer
14 years 27 days ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm
ISMB
1997
14 years 7 days ago
Standardized Representations of the Literature: Combining Diverse Sources of Ribosomal Data
We are building a knowledge base (KB) of published structural data on the 30s ribosomal subunit in prokaryotes. Our KB is distinguished by a standardized representation of biologi...
Russ B. Altman, Neil F. Abernethy, Richard O. Chen
MOBICOM
2010
ACM
13 years 11 months ago
Privacy vulnerability of published anonymous mobility traces
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 11 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi