Sciweavers

855 search results - page 92 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
ACL
2009
14 years 7 months ago
Distributional Representations for Handling Sparsity in Supervised Sequence-Labeling
Supervised sequence-labeling systems in natural language processing often suffer from data sparsity because they use word types as features in their prediction tasks. Consequently...
Fei Huang, Alexander Yates
CEC
2007
IEEE
15 years 1 months ago
Efficient relevance estimation and value calibration of evolutionary algorithm parameters
Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. The ...
Volker Nannen, A. E. Eiben
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
15 years 10 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
CIMCA
2005
IEEE
15 years 3 months ago
A GRASP with Adaptive Memory for a Period Vehicle Routing Problem
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem diffe...
Luciana B. Goncalves, Luiz Satoru Ochi, Simone L. ...
KRMED
2004
14 years 11 months ago
Using C-OWL for the alignment and merging of medical ontologies
A number of sophisticated medical ontologies have been created over the past years. With their development the need for supporting the alignment of different ontologies is gaining...
Heiner Stuckenschmidt, Frank van Harmelen, Paolo B...