3145 search results - page 327 / 629 » Algebraic Linear Orderings |
170
click to vote
RSA
2002
15 years 6 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
201
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
165
click to vote
BIBE
2008
IEEE
16 years 1 months ago
2008
IEEE
-This paper builds a two dimensional Oculomotor Plant Mathematical Model (2DOPMM) that is capable of generating eye movement trace on a two dimensional plane. The key difference be...
175
click to vote
HYBRID
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
181
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...