Sciweavers

1162 search results - page 111 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
SEMWEB
2010
Springer
13 years 6 months ago
Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach
RDF(S) and OWL 2 currently support only static ontologies. In practice, however, the truth of statements often changes with time, and Semantic Web applications often need to repres...
Boris Motik
ICCCN
2008
IEEE
14 years 2 months ago
A Position-Based Deployment and Routing Approach for Directional Wireless Mesh Networks
—Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this...
Weisheng Si, Selvakennedy Selvadurai
ICIP
2007
IEEE
14 years 2 months ago
Classification by Cheeger Constant Regularization
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
Hsun-Hsien Chang, José M. F. Moura
DAM
2007
70views more  DAM 2007»
13 years 8 months ago
Tree-edges deletion problems with bounded diameter obstruction sets
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
Dekel Tsur
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 3 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara