840 search results - page 116 / 168 » The Complexity of the Extended GCD Problem |
129
click to vote
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
In this paper, we extend our previous work onjoint source-channel coding to scalablevideo transmissionover wireless direct-sequence code-division-multiple-access(DS-CDMA)multipath...
229
click to vote
GIS
2007
ACM
16 years 5 months ago
2007
ACM
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
108
click to vote
DAC
2001
ACM
16 years 5 months ago
2001
ACM
We present a methodology for microarchitectural customization of embedded processors by exploiting application information, thus attaining the twin benefits of processor standardi...
135
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
153
click to vote
PAKDD
2009
ACM
16 years 1 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...