941 search results - page 113 / 189 » Efficient Testing of Large Graphs |
151
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
ACL
2010
14 years 7 months ago
2010
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
TIT
2008
14 years 9 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
SMA
2008
ACM
14 years 9 months ago
2008
ACM
We present an interactive algorithm for continuous collision detection between deformable models. We introduce two techniques to improve the culling efficiency and reduce the numb...
148
Voted
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...