Sciweavers

56 search results - page 6 / 12
» adhoc 2011
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 4 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov
ICASSP
2011
IEEE
13 years 1 months ago
Adaptive N-normalization for enhancing music similarity
The N-Normalization is an efficient method for normalizing a given similarity computed among multimedia objects. It can be considered for clustering and kernel enhancement. Howev...
Mathieu Lagrange, George Tzanetakis
ICASSP
2011
IEEE
13 years 1 months ago
Decision tree-based context clustering based on cross validation and hierarchical priors
The standard, ad-hoc stopping criteria used in decision tree-based context clustering are known to be sub-optimal and require parameters to be tuned. This paper proposes a new app...
Heiga Zen, Mark J. F. Gales
CIDR
2011
253views Algorithms» more  CIDR 2011»
13 years 1 months ago
Answering Queries using Humans, Algorithms and Databases
For some problems, human assistance is needed in addition to automated (algorithmic) computation. In sharp contrast to existing data management approaches, where human input is ei...
Aditya G. Parameswaran, Neoklis Polyzotis
ECIR
2011
Springer
13 years 1 months ago
A Novel Re-ranking Approach Inspired by Quantum Measurement
Abstract. Quantum theory (QT) has recently been employed to advance the theory of information retrieval (IR). A typical method, namely the Quantum Probability Ranking Principle (QP...
Xiaozhao Zhao, Peng Zhang, Dawei Song, Yuexian Hou