Sciweavers

2079 search results - page 372 / 416
» Universality of random graphs
Sort
View
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 1 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
ASUNAM
2010
IEEE
15 years 1 months ago
Semi-Supervised Classification of Network Data Using Very Few Labels
The goal of semi-supervised learning (SSL) methods is to reduce the amount of labeled training data required by learning from both labeled and unlabeled instances. Macskassy and Pr...
Frank Lin, William W. Cohen
AAAI
2010
15 years 1 months ago
Diversifying Query Suggestion Results
In order to improve the user search experience, Query Suggestion, a technique for generating alternative queries to Web users, has become an indispensable feature for commercial s...
Hao Ma, Michael R. Lyu, Irwin King
COLING
2008
15 years 1 months ago
An Integrated Probabilistic and Logic Approach to Encyclopedia Relation Extraction with Multiple Features
We propose a new integrated approach based on Markov logic networks (MLNs), an effective combination of probabilistic graphical models and firstorder logic for statistical relatio...
Xiaofeng Yu, Wai Lam
OPODIS
2008
15 years 1 months ago
Rendezvous of Mobile Agents When Tokens Fail Anytime
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...
Shantanu Das, Matús Mihalák, Rastisl...