17920 search results - page 3263 / 3584 » Recentering computer science |
199
click to vote
CSL
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
185
click to vote
GECCO
2007
Springer
16 years 28 days ago
2007
Springer
The accurate quantification of proteins is important in several areas of cell biology, biotechnology and medicine. Both relative and absolute quantification of proteins is often d...
177
click to vote
ICALP
2007
Springer
16 years 27 days ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
156
click to vote
MFCS
2007
Springer
16 years 27 days ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
161
click to vote
MFCS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...