4171 search results - page 671 / 835 » Choice numbers of graphs |
203
click to vote
ALGOSENSORS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
180
click to vote
FOCS
2007
IEEE
16 years 25 days ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
162
click to vote
ASIAN
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. A software birthmark is a unique characteristic of a program that can be used as a software theft detection. In this paper we suggest and empirically evaluate a static bi...
186
click to vote
CSL
2007
Springer
16 years 20 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...
162
click to vote
STACS
2007
Springer
16 years 18 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...