Sciweavers

2542 search results - page 394 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
CHI
2008
ACM
16 years 1 months ago
K-sketch: a 'kinetic' sketch pad for novice animators
Because most animation tools are complex and timeconsuming to learn and use, most animations today are created by experts. To help novices create a wide range of animations quickl...
Richard C. Davis, Brien Colwell, James A. Landay
MOBIHOC
2008
ACM
16 years 5 days ago
P2P-based routing and data management using the virtual cord protocol (VCP)
We present Virtual Cord Protocol (VCP), a virtual relative position based routing protocol for sensor networks that also provides methods for data management as known from standar...
Abdalkarim Awad, Reinhard German, Falko Dressler
78
Voted
DCC
2001
IEEE
16 years 5 days ago
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
Houshou Chen, John T. Coffey
113
Voted

Publication
309views
15 years 9 months ago
Improving Nearest Neighbor Classification with Cam Weighted Distance
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
Changyin Zhou, Yanqiu Chen
91
Voted
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
15 years 9 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He