4679 search results - page 285 / 936 » Modeling When Connections Are the Problem |
175
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
219
click to vote
SIAMDM
2010
15 years 5 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
187
click to vote
VR
2010
IEEE
15 years 5 months ago
2010
IEEE
A collaborative virtual environment (CVE) allows remote users to access and modify shared data through networks, such as the Internet. However, when the users are connected via th...
184
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we attempt to further demonstrate connections between information theory and control, in a networked setting. Specifically, we consider the communication problem of b...
187
click to vote
ICMCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...