2004 search results - page 55 / 401 » Sampling from large graphs |
121
Voted
ICS
2010
Tsinghua U.
16 years 3 days ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
198
Voted
ECCV
2010
Springer
15 years 2 days ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
241
Voted
NLP
2000
15 years 6 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
117
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
104
click to vote
NAACL
2007
15 years 4 months ago
2007
This paper describes an efficient method to extract large n-best lists from a word graph produced by a statistical machine translation system. The extraction is based on the k sh...