Sciweavers

2440 search results - page 280 / 488
» Data-Intensive Question Answering
Sort
View
125
Voted
COMBINATORICS
2004
106views more  COMBINATORICS 2004»
15 years 4 months ago
Random Matrices, Magic Squares and Matching Polynomials
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
Persi Diaconis, Alexander Gamburd
AML
2000
71views more  AML 2000»
15 years 4 months ago
Consistency of V = HOD with the wholeness axiom
The Wholeness Axiom (WA) is an axiom schema that can be added to the axioms of ZFC in an extended language {, j}, and that asserts the existence of a nontrivial elementary embeddin...
Paul Corazza
CJ
2002
67views more  CJ 2002»
15 years 4 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
161
Voted
COLING
2002
15 years 4 months ago
Fine Grained Classification of Named Entities
While Named Entity extraction is useful in many natural language applications, the coarse categories that most NE extractors work with prove insufficient for complex applications ...
Michael Fleischman, Eduard H. Hovy
COMBINATORICS
2002
88views more  COMBINATORICS 2002»
15 years 4 months ago
Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...
Michael O. Albertson, Joan P. Hutchinson