Sciweavers

5962 search results - page 210 / 1193
» Efficient Clustering for Orders
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Efficient context adaptive entropy coding for real-time applications
Context based entropy coding has the potential to provide higher gain over memoryless entropy coding. However serious difficulties arise regarding the practical implementation in...
Guillaume Fuchs, Vignesh Subbaraman, Markus Multru...
ISCI
2006
167views more  ISCI 2006»
15 years 6 months ago
Efficient unbalanced merge-sort
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, th...
Enrico Nardelli, Guido Proietti
BMCBI
2007
163views more  BMCBI 2007»
15 years 6 months ago
A coherent graph-based semantic clustering and summarization approach for biomedical literature and a new summarization evaluati
Background: A huge amount of biomedical textual information has been produced and collected in MEDLINE for decades. In order to easily utilize biomedical information in the free t...
Illhoi Yoo, Xiaohua Hu, Il-Yeol Song
RTCSA
2008
IEEE
16 years 1 months ago
Efficient Query Processing for Tracing RFID Tags by Reordering Location Identifiers
This paper addresses the problem of using the Location IDentifier (LID) as the domain value of the index for trajectories of RFID tags and proposes the solution for solving this p...
Sungwoo Ahn, Bonghee Hong
SPAA
2005
ACM
16 years 6 days ago
Efficient algorithms for verifying memory consistency
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
Chaiyasit Manovit, Sudheendra Hangal