Sciweavers

1067 search results - page 118 / 214
» Probabilistic regular graphs
Sort
View
ALT
2007
Springer
16 years 4 days ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
15 years 4 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman
ACSD
2008
IEEE
107views Hardware» more  ACSD 2008»
15 years 5 months ago
Discrete real-time and stochastic-time process algebra for performance analysis of distributed systems
We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the paral...
Jasen Markovski, Erik P. de Vink
GG
2008
Springer
15 years 4 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
ICPR
2008
IEEE
15 years 9 months ago
Semi-supervised learning by locally linear embedding in kernel space
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
Rujie Liu, Yuehong Wang, Takayuki Baba, Daiki Masu...