Sciweavers

2835 search results - page 317 / 567
» Automatic Question Answering
Sort
View
CJ
2002
67views more  CJ 2002»
15 years 6 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...
COMBINATORICS
2002
88views more  COMBINATORICS 2002»
15 years 6 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
CORR
2000
Springer
88views Education» more  CORR 2000»
15 years 6 months ago
The lexicographic closure as a revision process
The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e...
Richard Booth
ENTCS
2002
97views more  ENTCS 2002»
15 years 6 months ago
Sketch Data Models, Relational Schema and Data Specifications
When different mathematical models are used for software analysis and development it is important to understand their relationships. When the models are truly mathematical, and wh...
Michael Johnson, Robert D. Rosebrugh
COMBINATORICS
1999
99views more  COMBINATORICS 1999»
15 years 6 months ago
Deformation of Chains via a Local Symmetric Group Action
A symmetric group action on the maximal chains in a finite, ranked poset is local if the adjacent transpositions act in such a way that (i, i + 1) sends each maximal chain either ...
Patricia Hersh