2356 search results - page 20 / 472 » Characterizations of postman sets |
BMCBI
2010
14 years 12 months ago
2010
Background: Analyzing interaction networks for functional characterization poses significant challenges arising from the noisy, incomplete, and generic nature of both the interact...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
CICLING
2007
Springer
15 years 6 months ago
2007
Springer
This paper investigates the problem of automatic humour recognition, and provides and in-depth analysis of two of the most frequently observed features of humorous text: human-cent...
ARSCOM
2008
14 years 12 months ago
2008
The eccentricity e(v) of a vertex v in a strongly connected digraph G is the maximum distance from v. The eccentricity sequence of a digraph is the list of eccentricities of its v...
107
click to vote
MOR
2008
14 years 11 months ago
2008
In this paper, we consider two geometric optimization problems that are dual to each other and characterize conditions under which the optimal values of the two problems are equal...