Sciweavers

2031 search results - page 203 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ENTCS
2002
128views more  ENTCS 2002»
14 years 10 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
JAL
1998
85views more  JAL 1998»
14 years 10 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
PAMI
1998
170views more  PAMI 1998»
14 years 10 months ago
Ordinal Measures for Image Correspondence
—We present ordinal measures of association for image correspondence in the context of stereo. Linear correspondence measures like correlation and the sum of squared difference b...
Dinkar N. Bhat, Shree K. Nayar
RC
2002
103views more  RC 2002»
14 years 10 months ago
Exact Minkowski Products of N Complex Disks
An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N > 2, this boundary curve may be regarded as a gen...
Rida T. Farouki, Helmut Pottmann
SIGIR
2002
ACM
14 years 10 months ago
Unsupervised document classification using sequential information maximization
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
Noam Slonim, Nir Friedman, Naftali Tishby