Sciweavers

693 search results - page 59 / 139
» Categorical Properties of The Complex Numbers
Sort
View
CSR
2007
Springer
14 years 1 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ITP
2010
230views Mathematics» more  ITP 2010»
13 years 9 months ago
On the Formalization of the Lebesgue Integration Theory in HOL
Lebesgue integration is a fundamental concept in many mathematical theories, such as real analysis, probability and information theory. Reported higher-order-logic formalizations o...
Tarek Mhamdi, Osman Hasan, Sofiène Tahar
DCG
1998
53views more  DCG 1998»
13 years 7 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
COLING
2010
13 years 2 months ago
Exploring the Data-Driven Prediction of Prepositions in English
Prepositions in English are a well-known challenge for language learners, and the computational analysis of preposition usage has attracted significant attention. Such research ge...
Anas Elghafari, Detmar Meurers, Holger Wunsch
KDD
2002
ACM
113views Data Mining» more  KDD 2002»
14 years 8 months ago
Scalable robust covariance and correlation estimates for data mining
Covariance and correlation estimates have important applications in data mining. In the presence of outliers, classical estimates of covariance and correlation matrices are not re...
Fatemah A. Alqallaf, Kjell P. Konis, R. Douglas Ma...