Sciweavers

16616 search results - page 3286 / 3324
» Extending Extended Vacuity
Sort
View
SIAMCOMP
1998
86views more  SIAMCOMP 1998»
15 years 5 months ago
Exact Learning of Discretized Geometric Concepts
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 5 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
SIAMCOMP
1998
118views more  SIAMCOMP 1998»
15 years 5 months ago
Genericity, Randomness, and Polynomial-Time Approximations
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
Yongge Wang
169
Voted
SIGPLAN
1998
15 years 5 months ago
The DrScheme Project: An Overview
DrScheme provides a graphical user interface for editing and interactively evaluating Scheme programs on all major graphical platforms (Windows 95/nt, MacOs, Unix/X). The environm...
Matthias Felleisen, Robert Bruce Findler, Matthew ...
SMR
1998
89views more  SMR 1998»
15 years 5 months ago
Little languages: little maintenance?
So-called little, or domain-specific languages (DSLs), have the potential to make software maintenance simpler: domain-experts can directly use the DSL to make required routine m...
Arie van Deursen, Paul Klint
« Prev « First page 3286 / 3324 Last » Next »