18306 search results - page 364 / 3662 » Algorithmics in Exponential Time |
117
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
190
click to vote
PAMI
2006
15 years 6 months ago
2006
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of...
163
click to vote
TIT
2008
15 years 6 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
163
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
167
click to vote
ICNP
2007
IEEE
16 years 1 months ago
2007
IEEE
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...