20197 search results - page 3752 / 4040 » Comparing Computational Power |
109
click to vote
MOBIHOC
2009
ACM
16 years 3 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
126
click to vote
KDD
2001
ACM
16 years 3 months ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
117
click to vote
KDD
2001
ACM
16 years 3 months ago
2001
ACM
We introduce and evaluate TreeDT, a novel gene mapping method which is based on discovering and assessing tree-like patterns in genetic marker data. Gene mapping aims at discoveri...
103
click to vote
CHI
2008
ACM
16 years 3 months ago
2008
ACM
In a typical speech dictation interface, the recognizer's bestguess is displayed as normal, unannotated text. This ignores potentially useful information about the recognizer...
111
click to vote
CHI
2008
ACM
16 years 3 months ago
2008
ACM
We present an empirical analysis of crossing-based dialog boxes. First, we study the spatial constraints required for efficient crossing-based interactions in the case of a simple...