5962 search results - page 305 / 1193 » Efficient Clustering for Orders |
165
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: In real-time PCR, it is necessary to consider the efficiency of amplification (EA) of amplicons in order to determine initial target levels properly. EAs can be deduce...
134
click to vote
IPL
2002
15 years 6 months ago
2002
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
155
click to vote
DAM
2006
15 years 6 months ago
2006
Sub-dominant theory provides efficient tools for clustering. However it classically works only for ultrametrics and ad hoc extensions like Jardine and Sibson's 2ultrametrics....
220
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
156
click to vote
VLSID
2005
IEEE
16 years 7 months ago
2005
IEEE
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expre...