3268 search results - page 518 / 654 » The hub number of a graph |
177
click to vote
FOCS
2007
IEEE
16 years 22 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...
158
click to vote
ASIAN
2007
Springer
16 years 17 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...
183
click to vote
CSL
2007
Springer
16 years 17 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...
160
click to vote
STACS
2007
Springer
16 years 15 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...
135
click to vote
CGO
2006
IEEE
16 years 14 days ago
2006
IEEE
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...