16666 search results - page 3032 / 3334 » Descriptive and Computational Complexity |
164
click to vote
PKC
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
169
click to vote
FOCS
2006
IEEE
16 years 21 days ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
233
click to vote
FOCS
2006
IEEE
16 years 21 days ago
2006
IEEE
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
197
click to vote
ICAC
2006
IEEE
16 years 21 days ago
2006
IEEE
— Recent advances have demonstrated the potential benefits of coordinated management of thermal load in data centers, including reduced cooling costs and improved resistance to ...
176
click to vote
ICPP
2006
IEEE
16 years 21 days ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...