Sciweavers

1429 search results - page 108 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
STACS
2004
Springer
14 years 2 months ago
An Algorithmic View on OVSF Code Assignment
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
Thomas Erlebach, Riko Jacob, Matús Mihal&aa...
ATAL
2008
Springer
13 years 11 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 9 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 9 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
GISCIENCE
2004
Springer
130views GIS» more  GISCIENCE 2004»
14 years 2 months ago
Comparing Exact and Approximate Spatial Auto-regression Model Solutions for Spatial Data Analysis
The spatial auto-regression (SAR) model is a popular spatial data analysis technique, which has been used in many applications with geo-spatial datasets. However, exact solutions f...
Baris M. Kazar, Shashi Shekhar, David J. Lilja, Ra...