4171 search results - page 597 / 835 » Choice numbers of graphs |
189
click to vote
FOCS
2006
IEEE
16 years 20 days ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
176
click to vote
ISBI
2006
IEEE
16 years 19 days ago
2006
IEEE
Automated detection of stable fracture points in a sequence of Computed Tomography (CT) images is found to be a challenging task. In this paper, an innovative scheme for automatic...
210
click to vote
ISPDC
2005
IEEE
16 years 6 days ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
157
click to vote
DCOSS
2005
Springer
16 years 4 days ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
171
click to vote
SAMOS
2004
Springer
15 years 12 months ago
2004
Springer
A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component to optimally exploiting both...