4560 search results - page 384 / 912 » Finding Data in the Neighborhood |
195
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
178
click to vote
CANDC
2009
ACM
16 years 1 months ago
2009
ACM
This paper presents preliminary findings from our empirical study of the cognition employed by performers in improvisational theatre. Our study has been conducted in a laboratory ...
182
click to vote
CIBCB
2007
IEEE
16 years 1 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
170
click to vote
APSEC
2006
IEEE
16 years 26 days ago
2006
IEEE
In many software development projects, people tend to repeat same mistakes due to lack of shared knowledge from past experiences. Generally, it is very difficult to manually find ...
192
click to vote
ICMCS
2006
IEEE
16 years 25 days ago
2006
IEEE
Distance metric is widely used in similarity estimation. In this paper we find that the most popular Euclidean and Manhattan distance may not be suitable for all data distribution...