1629 search results - page 155 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
WSDM
2009
ACM
15 years 5 months ago
2009
ACM
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
111
click to vote
SIGSOFT
2007
ACM
15 years 11 months ago
2007
ACM
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
114
click to vote
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
109
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
MASCOTS
2007
14 years 11 months ago
2007
—One of the biggest bottlenecks in desktop-based computing is the hard disk with I/O write latency being a key contributor. I/O write latency stems from the mechanical nature of ...