Sciweavers

8437 search results - page 1449 / 1688
» Preferences over Sets
Sort
View
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 11 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
182
Voted
SIGMOD
2010
ACM
231views Database» more  SIGMOD 2010»
15 years 11 months ago
Automatically incorporating new sources in keyword search-based data integration
Scientific data offers some of the most interesting challenges in data integration today. Scientific fields evolve rapidly and accumulate masses of observational and experiment...
Partha Pratim Talukdar, Zachary G. Ives, Fernando ...
SPAA
2010
ACM
15 years 11 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
15 years 11 months ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden
FOSSACS
2001
Springer
15 years 11 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
« Prev « First page 1449 / 1688 Last » Next »