Sciweavers

1949 search results - page 177 / 390
» Random graphs on surfaces
Sort
View
ALT
2007
Springer
16 years 1 months 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
FOCS
1994
IEEE
15 years 8 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 6 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter
ICPR
2006
IEEE
16 years 5 months ago
Patterns of Co-Linear Equidistant Letter Sequences and Verses
It has been shown ([4], [3]) that equidistant letter sequence (ELS) pairs in the book of Genesis (G) form more compact geometric patterns on the surface of a cylinder than is expe...
Nachum Bombach, Harold Gans
128
Voted
ICML
2009
IEEE
16 years 5 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang