685 search results - page 67 / 137 » Closure Operators for Order Structures |
147
Voted
TIP
2008
15 years 2 months ago
2008
We consider the problem of detecting object contours in natural images. In many cases, local luminance changes turn out to be stronger in textured areas than on object contours. Th...
179
Voted
CPAIOR
2010
Springer
15 years 17 days ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
106
click to vote
WEA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
124
Voted
WOLLIC
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
108
Voted
WSC
2000
15 years 3 months ago
2000
Discrete event simulations often require a future event list structure to manage events according to their timestamp. The choice of an efficient data structure is vital to the per...