Sciweavers

855 search results - page 82 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
COLT
2003
Springer
15 years 3 months ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ï¬...
Mehryar Mohri
ICDT
2010
ACM
161views Database» more  ICDT 2010»
15 years 7 months ago
Composition with Target Constraints
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...
Marcelo Arenas, Ronald Fagin, Alan Nash
NIPS
2007
14 years 11 months ago
The discriminant center-surround hypothesis for bottom-up saliency
The classical hypothesis, that bottom-up saliency is a center-surround process, is combined with a more recent hypothesis that all saliency decisions are optimal in a decision-the...
Dashan Gao, Vijay Mahadevan, Nuno Vasconcelos
SIAMSC
2010
140views more  SIAMSC 2010»
14 years 8 months ago
Parallel High-Order Integrators
In this work we discuss a class of defect correction methods which is easily adapted to create parallel time integrators for multi-core architectures and is ideally suited for deve...
Andrew J. Christlieb, Colin B. Macdonald, Benjamin...
CEC
2011
IEEE
13 years 9 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow