2340 search results - page 44 / 468 » Second quarter 2008 |
CPC
2004
14 years 11 months ago
2004
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic ...
102
click to vote
DATAMINE
2002
14 years 11 months ago
2002
An overview of cluster analysis techniques from a data mining point of view is given. This is done by a strict separation of the questions of various similarity and distance measur...
DM
1998
14 years 11 months ago
1998
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
111
click to vote
CGF
1999
14 years 11 months ago
1999
This paper describes a new algorithm that employs image-based rendering for fast occlusion culling in complex urban environments. It exploits graphics hardware to render and autom...
CONSTRAINTS
1999
14 years 11 months ago
1999
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...