11211 search results - page 396 / 2243 » Rank-Sensitive Data Structures |
205
click to vote
DATESO
2009
15 years 4 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
172
click to vote
JLP
2010
15 years 1 months ago
2010
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
181
click to vote
IPTPS
2005
Springer
16 years 6 days ago
2005
Springer
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
180
click to vote
AGENTS
2000
Springer
15 years 11 months ago
2000
Springer
Adaptivity, both of the individual agents and of the interaction structure among the agents, seems indispensable for scaling up multi-agent systems MAS's in noisy environme...
171
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Protein loops encompass 50% of protein residues in available three-dimensional structures. These regions are often involved in protein functions, e.g. binding site, ca...