Sciweavers

3267 search results - page 580 / 654
» Generalized quasirandom graphs
Sort
View
JAL
1998
85views more  JAL 1998»
14 years 10 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
JSYML
2002
170views more  JSYML 2002»
14 years 10 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
84
Voted
RSA
2008
94views more  RSA 2008»
14 years 10 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
CIKM
2010
Springer
14 years 9 months ago
MENTA: inducing multilingual taxonomies from wikipedia
In recent years, a number of projects have turned to Wikipedia to establish large-scale taxonomies that describe orders of magnitude more entities than traditional manually built ...
Gerard de Melo, Gerhard Weikum
CIKM
2010
Springer
14 years 9 months ago
Hypergraph-based multilevel matrix approximation for text information retrieval
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
Haw-ren Fang, Yousef Saad