1511 search results - page 174 / 303 » Randomness, lowness and degrees |
148
click to vote
EPEW
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we experimentally investigate if optimal retry times can be determined based on models that assume independence of successive tries. We do this using data obtained fo...
156
click to vote
VTS
1995
IEEE
15 years 10 months ago
1995
IEEE
Optimized locally exhaustive test pattern generators based on linear sums promise a low overhead, but have an irregular structure. The paper presents a new algorithm able to compu...
173
click to vote
MVA
2007
15 years 7 months ago
2007
Counting cells and following the evolution of the biological layers are important applications in microscopic imagery. In this paper, a microscopic image segmentation method with ...
188
click to vote
NIPS
2004
15 years 7 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
133
click to vote
OPODIS
2004
15 years 7 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...