Sciweavers

1897 search results - page 195 / 380
» Sparse Additive Machine
Sort
View
TNN
2008
129views more  TNN 2008»
15 years 6 months ago
Data Visualization and Dimensionality Reduction Using Kernel Maps With a Reference Point
In this paper, a new kernel-based method for data visualization and dimensionality reduction is proposed. A reference point is considered corresponding to additional constraints ta...
Johan A. K. Suykens
NETWORKS
2007
15 years 5 months ago
Metaheuristics for the vehicle routing problem with loading constraints
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
Karl F. Doerner, Guenther Fuellerer, Richard F. Ha...
ICML
1998
IEEE
16 years 7 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
SIGMOD
2007
ACM
132views Database» more  SIGMOD 2007»
16 years 6 months ago
A dynamic and flexible sensor network platform
SwissQM is a novel sensor network platform for acquiring data from the real world. Instead of statically hand-crafted programs, SwissQM is a virtual machine capable of executing b...
Donald Kossmann, Gustavo Alonso, Jan S. Rellermeye...
170
Voted
RTA
2005
Springer
15 years 11 months ago
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
Proof-carrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set ...
Amy P. Felty