Sciweavers

7773 search results - page 1208 / 1555
» On generalized Frame-Stewart numbers
Sort
View
197
Voted
JMLR
2008
100views more  JMLR 2008»
15 years 6 months ago
Hit Miss Networks with Applications to Instance Selection
In supervised learning, a training set consisting of labeled instances is used by a learning algorithm for generating a model (classifier) that is subsequently employed for decidi...
Elena Marchiori
191
Voted
BIB
2002
136views more  BIB 2002»
15 years 6 months ago
Technologies for Integrating Biological Data
The process of building a new database relevant to some field of study in biomedicine involves transforming, integrating, and cleansing multiple data sources, as well as adding ne...
L. Wong
TIT
1998
90views more  TIT 1998»
15 years 6 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani
186
Voted
TSMC
1998
99views more  TSMC 1998»
15 years 6 months ago
Learning visually guided grasping: a test case in sensorimotor learning
Abstract—We present a general scheme for learning sensorimotor tasks which allows rapid on-line learning and generalization of the learned knowledge to unfamiliar objects. The sc...
Ishay Kamon, Tamar Flash, Shimon Edelman
JCSS
2008
120views more  JCSS 2008»
15 years 6 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
« Prev « First page 1208 / 1555 Last » Next »