Sciweavers

10602 search results - page 13 / 2121
» Weakly Useful Sequences
Sort
View
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 2 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
EMNLP
2008
14 years 11 months ago
Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured...
Partha Pratim Talukdar, Joseph Reisinger, Marius P...
ICMCS
2010
IEEE
178views Multimedia» more  ICMCS 2010»
14 years 10 months ago
Optimal configuration of hash table based multimedia fingerprint databases using weak bits
The increasingly large amount of digital multimedia content has created a need for technologies to search and identify multimedia files. Multimedia fingerprinting has been widely ...
Claus Bauer, Regunathan Radhakrishnan, Wenyu Jiang
60
Voted
IFE
2007
48views more  IFE 2007»
14 years 9 months ago
Restricting skyline sizes using weak Pareto dominance
Wolf-Tilo Balke, Ulrich Güntzer, Wolf Sibersk...
IWPSE
2003
IEEE
15 years 2 months ago
CVS Release History Data for Detecting Logical Couplings
The dependencies and interrelations between classes and modules affect the maintainability of object-oriented systems. It is therefore important to capture weaknesses of the softw...
Harald Gall, Mehdi Jazayeri, Jacek Krajewski