3008 search results - page 57 / 602 » Independence in connected graphs |
87
Voted
PAMI
2010
14 years 11 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...
80
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
113
click to vote
PPOPP
2012
ACM
13 years 8 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
103
Voted
WABI
2005
Springer
15 years 6 months ago
2005
Springer
We present recent developments in efficiently maintaining the boundary and surface area of protein molecules as they undergo conformational changes. As the method that we devised k...
115
click to vote
DAGM
2008
Springer
15 years 2 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...