Sciweavers

476 search results - page 13 / 96
» The Complexity of Equality Constraint Languages
Sort
View
CAD
2000
Springer
13 years 7 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier
ICFP
2008
ACM
14 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
SLP
1994
121views more  SLP 1994»
13 years 9 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
TWC
2008
139views more  TWC 2008»
13 years 7 months ago
Statistical Multimode Transmit Antenna Selection for Limited Feedback MIMO Systems
In a wireless multiple-input multiple-output (MIMO) system, transmit antenna selection is an effective means of achieving good performance with low complexity. We consider spatial ...
Chang Soon Park, Kwang Bok Lee
CP
1999
Springer
13 years 12 months ago
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Claudio Lottaz