16626 search results - page 3104 / 3326 » Computing is a natural science |
173
click to vote
ICALP
2007
Springer
16 years 24 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...
172
click to vote
ICALP
2007
Springer
16 years 24 days ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
199
click to vote
IPSN
2007
Springer
16 years 23 days ago
2007
Springer
We introduce a novel laser spectroscopic trace-gas sensor platform, LaserSPECks that integrates recently developed miniature quartz-enhanced photoacoustic spectroscopy (QEPAS) gas...
154
click to vote
MFCS
2007
Springer
16 years 23 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...
160
click to vote
MFCS
2007
Springer
16 years 23 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...