Sciweavers

1538 search results - page 25 / 308
» Relative Randomness and Cardinality
Sort
View
ORDER
2006
128views more  ORDER 2006»
13 years 9 months ago
Algebras Defined from Ordered Sets and the Varieties they Generate
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by the...
Joel Berman, Willem J. Blok
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 1 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
IJCAI
2007
13 years 11 months ago
Counting Complexity of Propositional Abduction
Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence and related topics. In this paper, we concentrate on propositional ab...
Miki Hermann, Reinhard Pichler
CORR
2010
Springer
89views Education» more  CORR 2010»
13 years 9 months ago
The SIMO Pre-Log Can Be Larger Than the SISO Pre-Log
Abstract--We establish a lower bound on the noncoherent capacity pre-log of a temporally correlated Rayleigh block-fading single-input multiple-output (SIMO) channel. Surprisingly,...
Veniamin I. Morgenshtern, Giuseppe Durisi, Helmut ...
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 4 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu