2656 search results - page 247 / 532 » Design and analysis of algorithms reconsidered |
194
click to vote
CIE
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
208
click to vote
CIKM
2008
Springer
15 years 9 months ago
2008
Springer
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
207
click to vote
AAAI
2006
15 years 8 months ago
2006
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
221
click to vote
PLDI
2010
ACM
16 years 10 days ago
2010
ACM
Static analysis designers must carefully balance precision and efficiency. In our experience, many static analysis tools are built around an elegant, core algorithm, but that alg...
208
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
We present a method for automated topic suggestion. Given a plain-text input document, our algorithm produces a ranking of novel topics that could enrich the input document in a m...