Sciweavers

1376 search results - page 74 / 276
» The Localization Hypothesis and Machines
Sort
View
TNN
2010
143views Management» more  TNN 2010»
13 years 4 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
NDSS
2000
IEEE
14 years 2 months ago
Accountability and Control of Process Creation in Metasystems
The distinguishing feature of a metasystem is middleware that facilitates viewing a collection of large, distributed, heterogeneous resources as a single virtual machine, where ea...
Marty Humphrey, Frederick Knabe, Adam Ferrari, And...
SIGGRAPH
1996
ACM
14 years 2 months ago
VC-1: A Scalable Graphics Computer with Virtual Local Frame Buffers
The VC-1 is a parallel graphics machine for polygon rendering based on image composition. This paper describes the architecture of the VC-1 along with a parallel polygon rendering...
Satoshi Nishimura, Tosiyasu L. Kunii
RSEISP
2007
Springer
14 years 4 months ago
Checking Brain Expertise Using Rough Set Theory
Most information about the external world comes from our visual brain. However, it is not clear how this information is processed. We will analyze brain responses using machine lea...
Andrzej W. Przybyszewski
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
14 years 3 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...