Sciweavers

2031 search results - page 54 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ACL
2007
14 years 11 months ago
Kinds of Features for Chinese Opinionated Information Retrieval
This paper presents the results of experiments in which we tested different kinds of features for retrieval of Chinese opinionated texts. We assume that the task of retrieval of o...
Taras Zagibalov
IPL
2008
104views more  IPL 2008»
14 years 9 months ago
A note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
Gabriela Araujo, József Balogh, Ruy Fabila ...
AAIP
2009
14 years 7 months ago
Synthesis of Functions Using Generic Programming
Abstract. This paper describes a very flexible way to synthesize functions matching a given predicate. This can be used to find general recursive functions or -terms obeying an inp...
Pieter W. M. Koopman, Rinus Plasmeijer
COMBINATORICS
2006
103views more  COMBINATORICS 2006»
14 years 9 months ago
A Note on Domino Shuffling
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
É. Janvresse, T. de la Rue, Y. Velenik
ICANN
2009
Springer
15 years 2 months ago
Learning from Examples to Generalize over Pose and Illumination
We present a neural system that recognizes faces under strong variations in pose and illumination. The generalization is learnt completely on the basis of examples of a subset of p...
Marco K. Müller, Rolf P. Würtz