1431 search results - page 94 / 287 » The complexity of random ordered structures |
134
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
142
click to vote
ASIACRYPT
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
341
click to vote
ICA
2012
Springer
13 years 10 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
126
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
132
click to vote
PODS
2007
ACM
16 years 3 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...