4171 search results - page 273 / 835 » Choice numbers of graphs |
214
click to vote
ISMB
1993
15 years 8 months ago
1993
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
141
click to vote
IS
2008
15 years 6 months ago
2008
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query proce...
201
click to vote
SIROCCO
2007
15 years 8 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
165
click to vote
TAP
2008
Springer
15 years 6 months ago
2008
Springer
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
178
click to vote
FOCS
2003
IEEE
16 years 2 days ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...