9842 search results - page 1926 / 1969 » The Complexity of the Matching-Cut Problem |
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
The selection of indexing terms for representing documents is a key decision that limits how effective subsequent retrieval can be. Often stemming algorithms are used to normaliz...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
As an indispensable technique in the field of Information Filtering, Recommender System has been well studied and developed both in academia and in industry recently. However, mo...
BIBE
2008
IEEE
14 years 2 months ago
2008
IEEE
— Heterogeneous genome-wide data sources capture information on various aspects of complex biological systems. For instance, transcriptome, interactome and phenome-level informat...
BIBE
2008
IEEE
14 years 2 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...