Sciweavers

13 search results - page 2 / 3
» Construction of Some Uncountable 2-Arc-Transitive Bipartite ...
Sort
View
JAPLL
2006
114views more  JAPLL 2006»
13 years 5 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
SIAMDM
2008
101views more  SIAMDM 2008»
13 years 5 months ago
On Planar Quasi-Parity Graphs
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
Cláudia Linhares Sales, Frédé...
IPPS
2005
IEEE
13 years 11 months ago
Distributed Scheduling of Parallel I/O in the Presence of Data Replication
This paper studies distributed scheduling of parallel I/O data transfers on systems that provide data replication. In our previous work, we proposed a centralized algorithm for so...
Jan-Jan Wu, Pangfeng Liu
COMSWARE
2007
IEEE
13 years 11 months ago
VillageNet: A low-cost, 802.11-based mesh network for rural regions
— VillageNet is a wireless mesh network that aims to provide low-cost broadband Internet access for rural regions. The cost of building the network is kept low by using off-the-s...
Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, ...
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro