Sciweavers

1542 search results - page 213 / 309
» Kernelization of packing problems
Sort
View
MICAI
2004
Springer
15 years 7 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
IFIP7
2001
Springer
137views Optimization» more  IFIP7 2001»
15 years 6 months ago
Data Mining via Support Vector Machines
Support vector machines (SVMs) have played a key role in broad classes of problems arising in various fields. Much more recently, SVMs have become the tool of choice for problems...
Olvi L. Mangasarian
CASES
2007
ACM
15 years 6 months ago
An efficient framework for dynamic reconfiguration of instruction-set customization
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
Huynh Phung Huynh, Joon Edward Sim, Tulika Mitra
AAAI
2008
15 years 4 months ago
Multi-View Local Learning
The idea of local learning, i.e., classifying a particular example based on its neighbors, has been successfully applied to many semi-supervised and clustering problems recently. ...
Dan Zhang, Fei Wang, Changshui Zhang, Tao Li
IJCAI
2003
15 years 3 months ago
Modular self-organization for a long-living autonomous agent
The aim of this paper is to provide a sound framework for addressing a difficult problem: the automatic construction of an autonomous agent's modular architecture. We briefly...
Bruno Scherrer