1274 search results - page 101 / 255 » Graph lambda theories |
126
click to vote
CORR
2011
Springer
14 years 8 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...
132
Voted
OWLED
2008
15 years 3 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...
129
click to vote
CVPR
2005
IEEE
16 years 3 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...
126
click to vote
FSTTCS
2008
Springer
15 years 2 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...
118
click to vote
CORR
2011
Springer
14 years 8 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...