14699 search results - page 247 / 2940 » Complexity and Cognitive Computing |
137
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
163
click to vote
Lecture Notes
Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001.
The focus of this chapter is on the Gen...
124
click to vote
JC
2006
15 years 4 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
132
click to vote
WABI
2001
Springer
15 years 8 months ago
2001
Springer
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
125
click to vote
LOGCOM
2007
15 years 3 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...