Sciweavers

4797 search results - page 800 / 960
» The complexity of partition tasks
Sort
View
NLE
2008
140views more  NLE 2008»
15 years 6 months ago
Active learning and logarithmic opinion pools for HPSG parse selection
For complex tasks such as parse selection, the creation of labelled training sets can be extremely costly. Resource-efficient schemes for creating informative labelled material mu...
Jason Baldridge, Miles Osborne
FGCS
2007
89views more  FGCS 2007»
15 years 6 months ago
Federated grid clusters using service address routed optical networks
Clusters of computers have emerged as cost-effective parallel and/or distributed computing systems for computationally intensive tasks. Normally, clusters are composed of high per...
Isaac D. Scherson, Daniel S. Valencia, Enrique Cau...
NCA
2006
IEEE
15 years 6 months ago
Evolutionary training of hardware realizable multilayer perceptrons
The use of multilayer perceptrons (MLP) with threshold functions (binary step function activations) greatly reduces the complexity of the hardware implementation of neural networks...
Vassilis P. Plagianakos, George D. Magoulas, Micha...
PR
2008
131views more  PR 2008»
15 years 6 months ago
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
Salvador García, José Ramón C...
PAMI
2006
125views more  PAMI 2006»
15 years 6 months ago
Channel Smoothing: Efficient Robust Smoothing of Low-Level Signal Features
In this paper, we present a new and efficient method to implement robust smoothing of low-level signal features: B-spline channel smoothing. This method consists of three steps: en...
Michael Felsberg, Per-Erik Forssén, Hanno S...