3008 search results - page 241 / 602 » Independence in connected graphs |
193
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
180
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
168
click to vote
ICAT
2007
IEEE
16 years 29 days ago
2007
IEEE
This study concerns the development of 3D interfaces that aid the navigation of large data structures through the usage of the HSV color space, and the ensuing āspatial framesā...
184
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
152
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We use support theory, in particular the fretsaw extensions of Shklarski and Toledo [ST06a], to design preconditioners for the stiļ¬ness matrices of 2-dimensional truss structure...