2434 search results - page 457 / 487 » Algorithmic Randomness of Closed Sets |
138
Voted
BCBGC
2008
15 years 1 months ago
2008
We introduce the data model BM, which specifies kernels of motifs by means of Boolean matrices. Different from position frequency matrices these only specify which bases can appea...
113
click to vote
SIROCCO
2008
15 years 1 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
101
Voted
BMCBI
2005
15 years 9 days ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
137
click to vote
TDSC
2010
14 years 10 months ago
2010
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
107
click to vote
TON
2010
14 years 10 months ago
2010
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...