2899 search results - page 130 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
141
click to vote
APWEB
2010
Springer
15 years 5 months ago
2010
Springer
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
166
click to vote
AAAI
2006
15 years 6 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
154
click to vote
DNA
2006
Springer
15 years 8 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
146
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
The fully scalable motion model (SMM) is proposed for scalable video codec by taking advantage of motion information scalability. In previous work, SMM has been improved to suppor...
148
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
The debate within the Web community over the optimal means by which to organize information often pits formalized classifications against distributed collaborative tagging systems...