Sciweavers

3946 search results - page 608 / 790
» The computational complexity of choice sets
Sort
View
TASLP
2010
102views more  TASLP 2010»
15 years 5 months ago
Representing Musical Sounds With an Interpolating State Model
—A computationally efficient algorithm is proposed for modeling and representing time-varying musical sounds. The aim is to encode individual sounds and not the statistical prop...
Anssi Klapuri, Tuomas Virtanen
WIOPT
2010
IEEE
15 years 5 months ago
A multiobjective performance evaluation framework for routing in wireless ad hoc networks
—Wireless ad hoc networks are seldom characterized by one single performance metric, yet the current literature lacks a flexible framework to assist in characterizing the design...
Katia Jaffrès-Runser, Mary R. Schurgot, Cri...
ACL
2010
15 years 4 months ago
Towards Robust Multi-Tool Tagging. An OWL/DL-Based Approach
This paper describes a series of experiments to test the hypothesis that the parallel application of multiple NLP tools and the integration of their results improves the correctne...
Christian Chiarcos
BMVC
2010
15 years 4 months ago
Manifold Alignment via Corresponding Projections
In this paper, we propose a novel manifold alignment method by learning the underlying common manifold with supervision of corresponding data pairs from different observation sets...
Deming Zhai, Bo Li, Hong Chang, Shiguang Shan, Xil...
MOBIHOC
2010
ACM
15 years 4 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan