Sciweavers

503 search results - page 33 / 101
» An Independence Relation for Sets of Secrets
Sort
View
ICML
2008
IEEE
15 years 10 months ago
Fully distributed EM for very large datasets
In EM and related algorithms, E-step computations distribute easily, because data items are independent given parameters. For very large data sets, however, even storing all of th...
Jason Wolfe, Aria Haghighi, Dan Klein
ACS
2008
14 years 10 months ago
Subobject Transformation Systems
Abstract Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pu...
Andrea Corradini, Frank Hermann, Pawel Sobocinski
ICDAR
1999
IEEE
15 years 2 months ago
Segmenting Documents using Multiple Lexical Features
A method is presented for segmenting documents into conceptually related areas. Determining the equivalence of text is often based on the number of word repetitions. This approach...
Amanda C. Jobbins, Lindsay J. Evett
IWPEC
2009
Springer
15 years 4 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
DAGSTUHL
2007
14 years 11 months ago
Propositional Relevance through Letter-Sharing: Review and Contribution
The concept of relevance between classical propositional formulae, defined in terms of letter-sharing, has been around for a very long time. But it began to take on a fresh life i...
David Makinson