Sciweavers

8437 search results - page 160 / 1688
» Preferences over Sets
Sort
View
DLT
2008
15 years 7 months ago
The Average State Complexity of the Star of a Finite Set of Words Is Linear
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
Frédérique Bassino, Laura Giambruno,...
ACL
2001
15 years 7 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod
ENVSOFT
2006
120views more  ENVSOFT 2006»
15 years 6 months ago
Improving the analyses of nestedness for large sets of matrices
Nestedness is a property of binary matrices of ecological data and quantified by the matrix's temperature, T. The program widely used to calculate T is Nestedness Temperature...
Paulo R. Guimarães Jr., Paulo Guimarã...
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
15 years 7 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
CONSTRAINTS
2007
89views more  CONSTRAINTS 2007»
15 years 6 months ago
Cardinal: A Finite Sets Constraint Solver
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
Francisco Azevedo