Sciweavers

691 search results - page 8 / 139
» Packing Small Vectors
Sort
View
FOCS
1998
IEEE
15 years 1 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio
ICANNGA
2007
Springer
128views Algorithms» more  ICANNGA 2007»
15 years 3 months ago
A Demonstration of Clustering in Protein Contact Maps for Alpha Helix Pairs
Abstract. The purpose of this work is to demonstrate that it is possible to cluster contact maps for pairs of alpha helices such that each of the clusters corresponds to a group of...
Robert Fraser, Janice I. Glasgow
84
Voted
FLAIRS
2008
14 years 12 months ago
Small Models of Large Machines
In this paper, we model large support vector machines (SVMs) by smaller networks in order to decrease the computational cost. The key idea is to generate additional training patte...
Pramod Lakshmi Narasimha, Sanjeev S. Malalur, Mich...
SPIRE
2004
Springer
15 years 3 months ago
Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Fraylin...
CVPR
2005
IEEE
15 years 9 months ago
A Framework of 2D Fisher Discriminant Analysis: Application to Face Recognition with Small Number of Training Samples
A novel framework called 2D Fisher Discriminant Analysis (2D-FDA) is proposed to deal with the Small Sample Size (SSS) problem in conventional One-Dimensional Linear Discriminan...
Hui Kong, Lei Wang, Eam Khwang Teoh, Jian-Gang Wan...