4865 search results - page 266 / 973 » The Complexity of Graph Connectivity |
165
click to vote
MOBICOM
2005
ACM
16 years 5 days ago
2005
ACM
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
203
click to vote
ISBI
2006
IEEE
16 years 7 months ago
2006
IEEE
Tagged Magnetic Resonance Imaging (MRI) is currently the reference MR modality for myocardial motion and strain analysis. Mutual Information (MI) based non rigid registration has ...
208
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
166
click to vote
SEMWEB
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...
186
click to vote
COCOON
2000
Springer
15 years 11 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...