1972 search results - page 157 / 395 » connection 2008 |
180
click to vote
SYRCODIS
2007
15 years 7 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
167
Voted
TREC
2007
15 years 7 months ago
2007
This paper describes several approaches which we used for the expert search task of the TREC 2007 Enterprise track. We studied several methods of relevance propagation from docume...
147
click to vote
WCE
2007
15 years 7 months ago
2007
—This paper presents a compact analog neuron cell with an array of charge-coupled synapses connected via a common output terminal. Synaptic responses are fed into a current mirro...
146
click to vote
AIEDAM
2008
15 years 6 months ago
2008
We describe a method for constructing a structural model of an unlabeled target two-dimensional line drawing by analogy to a known source model of a drawing with similar structure...
138
click to vote
ARSCOM
2008
15 years 6 months ago
2008
The eccentricity e(v) of a vertex v in a strongly connected digraph G is the maximum distance from v. The eccentricity sequence of a digraph is the list of eccentricities of its v...