2434 search results - page 364 / 487 » Algorithmic Randomness of Closed Sets |
119
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
132
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
181
Voted
BMCBI
2011
14 years 10 months ago
2011
Background: Phylogenetic trees are an important tool for representing evolutionary relationships among organisms. In a phylogram or chronogram, the ordering of taxa is not conside...
126
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
109
Voted
DGO
2008
15 years 4 months ago
2008
We address the e-rulemaking problem of reducing the manual labor required to analyze public comment sets. In current and previous work, for example, text categorization techniques...