Sciweavers

4924 search results - page 89 / 985
» Efficiency Improvement for NTRU
Sort
View
STOC
1994
ACM
95views Algorithms» more  STOC 1994»
13 years 11 months ago
Improved non-approximability results
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
Mihir Bellare, Madhu Sudan
FLAIRS
2001
13 years 9 months ago
Improvement of Nearest-Neighbor Classifiers via Support Vector Machines
Theoretically well-founded, Support Vector Machines (SVM)are well-knownto be suited for efficiently solving classification problems. Althoughimprovedgeneralization is the maingoal...
Marc Sebban, Richard Nock
DOLAP
2000
ACM
14 years 15 days ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer
AVI
2006
13 years 9 months ago
Oral messages improve visual search
Input multimodality combining speech and hand gestures has motivated numerous usability studies. Contrastingly, issues relating to the design and ergonomic evaluation of multimoda...
Suzanne Kieffer, Noelle Carbonell
DCC
2006
IEEE
14 years 7 months ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford