Sciweavers

3008 search results - page 323 / 602
» Independence in connected graphs
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Unsupervised modeling of object categories using link analysis techniques
We propose an approach for learning visual models of object categories in an unsupervised manner in which we first build a large-scale complex network which captures the interacti...
Gunhee Kim, Christos Faloutsos, Martial Hebert
ICML
2003
IEEE
16 years 7 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty
ICDE
2010
IEEE
236views Database» more  ICDE 2010»
16 years 4 months ago
Explaining Structured Queries in Natural Language
— Many applications offer a form-based environment for na¨ıve users for accessing databases without being familiar with the database schema or a structured query language. User...
Alkis Simitsis, Georgia Koutrika, Yannis E. Ioanni...
FOCS
2009
IEEE
16 years 1 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ICOIN
2007
Springer
16 years 28 days ago
Inter-Domain Access Volume Model: Ranking Autonomous Systems
Exploring topological structure at Autonomous System (AS) level is indispensable for understanding most issues in Internet services. Previous models of AS graph involve address or ...
Yixuan Wang, Ye Wang, Maoke Chen, Xing Li