Sciweavers

102 search results - page 6 / 21
» Extending Tree-Maps to Three Dimensions: A Comparative Study
Sort
View
IRI
2007
IEEE
14 years 1 months ago
Acronym-Expansion Recognition and Ranking on the Web
The paper presents a study on large-scale automatic extraction of acronyms and associated expansions from Web data and from the user interactions with this data through Web search...
Alpa Jain, Silviu Cucerzan, Saliha Azzam
MM
2004
ACM
101views Multimedia» more  MM 2004»
14 years 5 days ago
Searching notated polyphonic music using transportation distances
We present a method for searching databases of symbolically represented polyphonic music that exploits advantages of transportation distances such as continuity and partial matchi...
Rainer Typke, Remco C. Veltkamp, Frans Wiering
GECCO
2010
Springer
180views Optimization» more  GECCO 2010»
13 years 10 months ago
Comparison of NEWUOA with different numbers of interpolation points on the BBOB noisy testbed
In this paper, we study the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) with different numbers of interpolation points. NEWUOA is a trust region method, ...
Raymond Ros
ICDE
2003
IEEE
193views Database» more  ICDE 2003»
14 years 8 months ago
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...
CIKM
2010
Springer
13 years 5 months ago
FacetCube: a framework of incorporating prior knowledge into non-negative tensor factorization
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
Yun Chi, Shenghuo Zhu