Sciweavers

3591 search results - page 52 / 719
» Typing linear constraints
Sort
View
ORDER
2007
79views more  ORDER 2007»
13 years 10 months ago
Computable Linearizations of Well-partial-orderings
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....
Antonio Montalbán
ISPD
1999
ACM
83views Hardware» more  ISPD 1999»
14 years 3 months ago
Efficient solution of systems of orientation constraints
One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implem...
Joseph L. Ganley
ICFP
2003
ACM
14 years 10 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
ICCV
2009
IEEE
15 years 3 months ago
Heterogeneous Feature Machines for Visual Recognition
With the recent efforts made by computer vision researchers, more and more types of features have been designed to describe various aspects of visual characteristics. Modeling s...
Liangliang Cao, Jiebo Luo, Feng Liang, Thomas S. H...
ICDCS
2009
IEEE
14 years 8 months ago
A Commutative Replicated Data Type for Cooperative Editing
A Commutative Replicated Data Type (CRDT) is one where all concurrent operations commute. The replicas of a CRDT converge automatically, without complex concurrency control. This ...
Nuno M. Preguiça, Joan Manuel Marquè...