1327 search results - page 254 / 266 » Path following algorithm for the graph matching problem |
102
click to vote
WWW
2009
ACM
16 years 2 months ago
2009
ACM
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
114
click to vote
CONEXT
2010
ACM
14 years 11 months ago
2010
ACM
Profiling Internet backbone traffic is becoming an increasingly hard problem since users and applications are avoiding detection using traffic obfuscation and encryption. The key ...
116
Voted
RECOMB
2001
Springer
16 years 1 months ago
2001
Springer
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
IUI
2004
ACM
15 years 7 months ago
2004
ACM
Technical support procedures are typically very complex. Users often have trouble following printed instructions describing how to perform these procedures, and these instructions...
140
click to vote
EDBT
2012
ACM
13 years 4 months ago
2012
ACM
Conventional research on similarity search focuses on measuring the similarity between objects with the same type. However, in many real-world applications, we need to measure the...