Sciweavers

8141 search results - page 1595 / 1629
» Higher Order Generalization
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
COMGEO
1999
ACM
13 years 7 months ago
Multiresolution hierarchies on unstructured triangle meshes
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
Leif Kobbelt, Jens Vorsatz, Hans-Peter Seidel
DATAMINE
1999
143views more  DATAMINE 1999»
13 years 7 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
PR
1998
90views more  PR 1998»
13 years 7 months ago
Supportedness and tameness differentialless geometry of plane curves
—We introduce a class of planar arcs and curves, called tame arcs, which is general enough to describe (parts of) the boundaries of planar real objects. A tame arc can have smoot...
Longin Jan Latecki, Azriel Rosenfeld
SIAMCOMP
1998
102views more  SIAMCOMP 1998»
13 years 7 months ago
L-Printable Sets
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...
« Prev « First page 1595 / 1629 Last » Next »