4926 search results - page 231 / 986 » Two Graph Algorithms On an Associative Computing Model |
174
click to vote
NAACL
1994
15 years 7 months ago
1994
This research characterizes the spontaneous spoken disfluencies typical of human-computer interaction, and presents a predictive model accounting for their occurrence. Data were c...
161
click to vote
DAM
2010
15 years 3 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
197
click to vote
SGAI
2010
Springer
15 years 1 months ago
2010
Springer
: In the present paper we address the problem of computing the Minimal Additional Sensor Sets (MASS) that guarantee a desired level of diagnostic discrimination for a system. Recen...
179
Voted
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
181
click to vote
GLOBECOM
2007
IEEE
16 years 23 days ago
2007
IEEE
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...