335 search results - page 44 / 67 » How to Use Spanning Trees to Navigate in Graphs |
162
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
172
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
198
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
136
click to vote
PAMI
2010
15 years 4 months ago
2010
— Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a long-standing research objective for natural language pr...
173
click to vote
SIGECOM
1999
ACM
15 years 10 months ago
1999
ACM
Performance analysis and capacity planning for e-commerce sites poses an interesting problem: how to best characterize the workload of these sites. Tradition al workload character...