Sciweavers

4488 search results - page 80 / 898
» Properties of NP-Complete Sets
Sort
View
STACS
2009
Springer
14 years 17 days ago
An Order on Sets of Tilings Corresponding to an Order on Languages
Abstract. Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings...
Nathalie Aubrun, Mathieu Sablik
SIGIR
2010
ACM
13 years 12 months ago
Metrics for assessing sets of subtopics
To evaluate the diversity of search results, test collections have been developed that identify multiple intents for each query. Intents are the different meanings or facets that...
Filip Radlinski, Martin Szummer, Nick Craswell
AML
2006
83views more  AML 2006»
13 years 8 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
ENVSOFT
2006
120views more  ENVSOFT 2006»
13 years 8 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ã...
CORR
2007
Springer
87views Education» more  CORR 2007»
13 years 8 months ago
Entropy of capacities on lattices and set systems
We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability mea...
Aoi Honda, Michel Grabisch