Sciweavers

1749 search results - page 202 / 350
» Conditional colorings of graphs
Sort
View
ICRA
2002
IEEE
106views Robotics» more  ICRA 2002»
15 years 11 months ago
An Improved Random Neighborhood Graph Approach
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
Libo Yang, Steven M. LaValle
DAGSTUHL
2004
15 years 8 months ago
Application of Graph Transformation for Automating Web Service Discovery
The paper represents current achievements of an ongoing research that aims to develop a formal approach supporting an automatic selection of a Web service sought by a requestor. Th...
Reiko Heckel, Alexey Cherchago
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 6 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
ENTCS
2006
117views more  ENTCS 2006»
15 years 6 months ago
Interpreting SWRL Rules in RDF Graphs
An unresolved issue in SWRL (the Semantic Web Rule Language) is whether the intended semantics of its RDF representation can be described as an extension of the W3C RDF semantics....
Jing Mei, Harold Boley
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
16 years 7 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...