271 search results - page 2 / 55 » Graph limits and parameter testing |
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
COMPSAC
2009
IEEE
14 years 3 months ago
2009
IEEE
—This paper considers the task of software test case generation from a large space of values of input parameters. The purpose of the paper is to create a model of software input ...
ECCC
2000
13 years 8 months ago
2000
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
ICASSP
2011
IEEE
13 years 7 days ago
2011
IEEE
In this paper, we derive the Multidimensional Statistical Resolution Limit (MSRL) to resolve two closely spaced targets using a widely spaced MIMO radar. Toward this end, we perfo...
MST
2010
13 years 3 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...