Sciweavers

1431 search results - page 9 / 287
» The complexity of random ordered structures
Sort
View
DM
2010
97views more  DM 2010»
13 years 7 months ago
Random preorders and alignments
A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles on n labelled elements. We investigate the block structure of a...
Peter J. Cameron, Mihyun Kang, Dudley Stark
ESANN
2007
13 years 8 months ago
Order in Complex Systems of Nonlinear Oscillators: Phase Locked Subspaces
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...
Jan-Hendrik Schleimer, Ricardo Vigário
LICS
2000
IEEE
13 years 11 months ago
The Role of Decidability in First Order Separations over Classes of Finite Structures
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
Steven Lindell, Scott Weinstein
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 8 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
IM
2007
13 years 7 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang