1274 search results - page 101 / 255 » Graph lambda theories |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
OWLED
2008
13 years 10 months ago
2008
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
FSTTCS
2008
Springer
13 years 10 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...