16430 search results - page 875 / 3286 » On Computable Tree Functions |
204
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
223
click to vote
SC
2005
ACM
16 years 1 months ago
2005
ACM
The development of complex scientific applications for high-end systems is a challenging task. Addressing complexity of the involved software and algorithms is becoming increasing...
186
click to vote
COMPGEOM
2004
ACM
16 years 1 months ago
2004
ACM
We propose a generic computational framework for maintaining a discrete geometric structure defined by a collection of static and mobile objects. We assume that the mobile object...
214
click to vote
FOCS
2003
IEEE
16 years 27 days ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
168
click to vote
ATAL
2003
Springer
16 years 26 days ago
2003
Springer
Auctions are useful mechanism for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders’ valuations for ite...