Sciweavers

684 search results - page 97 / 137
» A characterization of b-perfect graphs
Sort
View
ITA
2007
104views Communications» more  ITA 2007»
14 years 11 months ago
Automata, Borel functions and real numbers in Pisot base
This note is about functions f : Aω → Bω whose graph is recognized by a B¨uchi finite automaton on the product alphabet A × B. These functions are Baire class 2 in the Bair...
Benoit Cagnard, Pierre Simonnet
CPC
2002
80views more  CPC 2002»
14 years 11 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
TCOM
2008
151views more  TCOM 2008»
14 years 10 months ago
Design of regular (2, dc)-LDPC codes over GF(q) using their binary images
In this paper, a method to design regular (2, dc)-LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of thei...
Charly Poulliat, Marc P. C. Fossorier, David Decle...
SEMWEB
2010
Springer
14 years 9 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
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
14 years 6 months ago
On optimal cooperative patrolling
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...