3267 search results - page 180 / 654 » Generalized quasirandom graphs |
172
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
We develop an approach to intrinsic dimension estimation based on k-nearest neighbor (kNN) distances. The dimension estimator is derived using a general theory on functionals of k...
175
click to vote
IAJIT
2008
15 years 6 months ago
2008
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
161
click to vote
ECEASST
2010
15 years 4 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
206
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
173
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...