Sciweavers

14061 search results - page 2 / 2813
» Finding
Sort
View
ICIAP
2003
ACM
14 years 5 months ago
Depth-first k-nearest neighbor finding using the MaxNearestDist estimator
A description is given of how to use an estimate of the maximum possible distance at which a nearest neighbor can be found to prune the search process in a depth-first branch and ...
Hanan Samet
ISMIR
2005
Springer
143views Music» more  ISMIR 2005»
13 years 11 months ago
Fuzzy Analysis in Pitch-Class Determination for Polyphonic Audio Key Finding
This paper presents a fuzzy analysis technique for pitch class determination that improves the accuracy of key finding from audio information. Errors in audio key finding, typical...
Ching-Hua Chuan, Elaine Chew
CIKM
2008
Springer
13 years 7 months ago
Modeling document features for expert finding
We argue that expert finding is sensitive to multiple document features in an organization, and therefore, can benefit from the incorporation of these document features. We propos...
Jianhan Zhu, Dawei Song, Stefan M. Rüger, Xia...
ERCIMDL
2005
Springer
139views Education» more  ERCIMDL 2005»
13 years 11 months ago
Finding Appropriate Learning Objects: An Empirical Evaluation
: The challenge of finding appropriate learning objects is one of the bottlenecks for end users in Learning Object Repositories (LORs). This paper investigates usability problems o...
Jehad Najjar, Joris Klerkx, Riina Vuorikari, Erik ...
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 5 months ago
Finding Dense Subgraphs in G(n,1/2)
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
Atish Das Sarma, Amit Deshpande, Ravi Kannan