Sciweavers

1221 search results - page 65 / 245
» Two Consistency Results on Set Mappings
Sort
View
UAI
2004
15 years 7 months ago
Maximum Entropy for Collaborative Filtering
Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with resp...
C. Lawrence Zitnick, Takeo Kanade
CORR
2006
Springer
142views Education» more  CORR 2006»
15 years 6 months ago
Exploiting multilingual nomenclatures and language-independent text features as an interlingua for cross-lingual text analysis a
We are proposing a simple, but efficient basic approach for a number of multilingual and cross-lingual language technology applications that are not limited to the usual two or th...
Ralf Steinberger, Bruno Pouliquen, Camelia Ignat
JSS
2010
215views more  JSS 2010»
15 years 4 months ago
Analyzing architectural styles
The backbone of many software architectures and component integration frameworks is an architectural style that provides a domain-specific design vocabulary and a set of constrai...
Jung Soo Kim, David Garlan
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
15 years 28 days ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...
MFCS
1998
Springer
15 years 10 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire