4865 search results - page 429 / 973 » The Complexity of Graph Connectivity |
156
click to vote
ISCAPDCS
2007
15 years 8 months ago
2007
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
185
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
In order to reduce the rejection rate of our automatic reading system, we propose to pre-classify the business documents by introducing an Automatic Recognition of Documents stage...
279
Voted
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
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...
188
Voted
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
— 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...
180
Voted
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
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...