Sciweavers

42230 search results - page 166 / 8446
» Algorithms and Complexity Results for
Sort
View
SOCA
2007
IEEE
16 years 22 days ago
Structure Matching for Enhancing UDDI Queries Results
To enhance UDDI query capability, typically based on taxonomic classification, semantic matching is assuming a key role. Even if we recognize the great importance of semantics in ...
Giancarlo Tretola, Eugenio Zimeo
ICDM
2005
IEEE
149views Data Mining» more  ICDM 2005»
16 years 2 days ago
A Join-Less Approach for Co-Location Pattern Mining: A Summary of Results
Spatial co-location patterns represent the subsets of features whose instances are frequently located together in geographic space. Co-location pattern discovery presents challeng...
Jin Soung Yoo, Shashi Shekhar, Mete Celik
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 12 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
GLOBECOM
2007
IEEE
15 years 6 months ago
A Gray-Code Type Bit Assignment Algorithm for Unitary Space-Time Constellations
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
Adam Panagos, Kurt L. Kosbar
STOC
1994
ACM
95views Algorithms» more  STOC 1994»
15 years 10 months ago
Improved non-approximability results
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
Mihir Bellare, Madhu Sudan