Sciweavers

3628 search results - page 352 / 726
» The Decision Diffie-Hellman Problem
Sort
View
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
15 years 6 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
IPL
2002
118views more  IPL 2002»
15 years 6 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
EXPERT
1998
83views more  EXPERT 1998»
15 years 6 months ago
Data-Driven Constructive Induction
Constructive induction divides the problem of learning an inductive hypothesis into two intertwined searches: one—for the “best” representation space, and two—for the “be...
Eric Bloedorn, Ryszard S. Michalski
JAIR
2002
182views more  JAIR 2002»
15 years 6 months ago
An Analysis of Phase Transition in NK Landscapes
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the unif...
Yong Gao, Joseph C. Culberson
CORR
1999
Springer
61views Education» more  CORR 1999»
15 years 6 months ago
Language Identification With Confidence Limits
A statistical classification algorithm and its application to language identification from noisy input are described. The main innovation is to compute confidence limits on the cl...
David Elworthy