Sciweavers

9477 search results - page 1532 / 1896
» Design is as Easy as Optimization
Sort
View
MOBIHOC
2009
ACM
16 years 7 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
16 years 7 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
KDD
2005
ACM
142views Data Mining» more  KDD 2005»
16 years 7 months ago
Towards exploratory test instance specific algorithms for high dimensional classification
In an interactive classification application, a user may find it more valuable to develop a diagnostic decision support method which can reveal significant classification behavior...
Charu C. Aggarwal
CHI
2008
ACM
16 years 7 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
CHI
2007
ACM
16 years 7 months ago
An interface to support color blind computer users
A new method for adapting digital images so that they are suitable for color blind viewers is presented. In contrast to earlier automatic methods which formulate the problem of ad...
Luke Jefferson, Richard Harvey
« Prev « First page 1532 / 1896 Last » Next »