15254 search results - page 50 / 3051 » A k |
SIAMDM
2008
14 years 9 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
107
click to vote
ALGORITHMICA
2010
14 years 8 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
64
Voted
HCI
2009
14 years 7 months ago
2009
In this study, super high-definition immersive visual data mining environment using 4K stereo projector was developed. In this system, data can be represented with high accuracy in...
ADMA
2005
Springer
15 years 3 months ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...