1431 search results - page 9 / 287 » The complexity of random ordered structures |
102
click to vote
DM
2010
15 years 2 months ago
2010
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...
133
Voted
ESANN
2007
15 years 3 months ago
2007
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...
106
click to vote
LICS
2000
IEEE
15 years 6 months ago
2000
IEEE
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...
131
Voted
SODA
2004
ACM
15 years 3 months ago
2004
ACM
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...
123
click to vote
IM
2007
15 years 2 months ago
2007
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 ...