2926 search results - page 333 / 586 » Partially Optimal Routing |
168
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
158
Voted
DLOG
2011
14 years 7 months ago
2011
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
169
Voted
Publication
![Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/mumphord_shah.jpg "Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems - [ Mumford-Shah ]")
"The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In com...
136
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
171
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...