Sciweavers

9842 search results - page 96 / 1969
» Problem complexity
Sort
View
AMSTERDAM
2009
14 years 7 months ago
The Data Complexity of the Syllogistic Fragments of English
Abstract. Pratt and Third's syllogistic fragments of English can be used to capture, in addition to syllogistic reasoning, many other kinds of common sense reasoning, and, in ...
Camilo Thorne, Diego Calvanese
ECML
2005
Springer
15 years 3 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
DCC
2006
IEEE
15 years 3 months ago
Quantization on the Complex Projective Space
This paper derives bounds on the distortion rate function for quantization on the complex projective space denoted as CPn−1 . In essence the problem of quantization in an Euclid...
Bishwarup Mondal, Satyaki Dutta, Robert W. Heath J...
KDD
1997
ACM
106views Data Mining» more  KDD 1997»
15 years 2 months ago
Clustering Sequences of Complex Objects
Sequential Data This paper is about the unsuperviseddiscovery of patterns in sequencesof compositeobjects. A compositeobject may be describedas a sequenceof other, simpler data. In...
A. Ketterlin
FSTTCS
1994
Springer
15 years 1 months ago
On the Interactive Complexity of Graph Reliability
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...