4926 search results - page 246 / 986 » Two Graph Algorithms On an Associative Computing Model |
183
Voted
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we investigate principles of the representation of time and modality in terms of conceptual graphs. Based on the works of A. N. Prior, and C. S. Peirce, we suggest a ...
218
click to vote
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
137
click to vote
GC
2002
Springer
15 years 6 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
202
click to vote
ICIC
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Using the classical Parzen window (PW) estimate as the target function, the sparse kernel density estimator is constructed in a forward constrained regression manner. The...
187
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
— In many application of noise cancellation, the changes in signal characteristics could be quite fast. This requires the utilization of adaptive algorithms, which converge rapid...