Sciweavers

5109 search results - page 570 / 1022
» On Learning Limiting Programs
Sort
View
ECML
2005
Springer
16 years 12 days ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
200
Voted
PVM
2005
Springer
16 years 10 days ago
Some Improvements to a Parallel Decomposition Technique for Training Support Vector Machines
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...
Thomas Serafini, Luca Zanni, Gaetano Zanghirati
SIGCSE
2004
ACM
110views Education» more  SIGCSE 2004»
16 years 9 days ago
An extensible framework for providing dynamic data structure visualizations in a lightweight IDE
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
T. Dean Hendrix, James H. Cross II, Larry A. Barow...
183
Voted
DATE
2003
IEEE
123views Hardware» more  DATE 2003»
16 years 5 days ago
Parallel Processing Architectures for Reconfigurable Systems
Novel reconfigurable computing architectures exploit the inherent parallelism available in many signalprocessing problems. These architectures often consist of networks of compute...
Kees A. Vissers
NIPS
2007
15 years 8 months ago
Subspace-Based Face Recognition in Analog VLSI
We describe an analog-VLSI neural network for face recognition based on subspace methods. The system uses a dimensionality-reduction network whose coefficients can be either progr...
Gonzalo Carvajal, Waldo Valenzuela, Miguel Figuero...