Sciweavers

1653 search results - page 225 / 331
» Computer science and game theory
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 3 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
15 years 5 months ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
88
Voted
ICALP
1994
Springer
15 years 3 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
RECOMB
2004
Springer
15 years 11 months ago
Interface surfaces for protein-protein complexes
Protein-protein interactions, which form the basis for most cellular processes, result in the formation of protein interfaces. Believing that the local shape of proteins is crucia...
Yih-En Andrew Ban, Herbert Edelsbrunner, Johannes ...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
15 years 11 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...