Sciweavers

2423 search results - page 481 / 485
» AnswerArt - Contextualized Question Answering
Sort
View
94
Voted
KBS
2000
122views more  KBS 2000»
14 years 9 months ago
Creating knowledge maps by exploiting dependent relationships
Knowledge is an interesting concept that has attracted the attention of philosophers for thousands of years. In more recent times, researchers have investigated knowledge in a mor...
John L. Gordon
CN
1998
207views more  CN 1998»
14 years 9 months ago
The Anatomy of a Large-Scale Hypertextual Web Search Engine
In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the...
Sergey Brin, Lawrence Page
115
Voted
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
14 years 9 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
DM
1999
65views more  DM 1999»
14 years 9 months ago
Finite three dimensional partial orders which are not sphere orders
Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...
Stefan Felsner, Peter C. Fishburn, William T. Trot...
JSYML
1998
61views more  JSYML 1998»
14 years 9 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah