Sciweavers

1533 search results - page 281 / 307
» Semantic Matching: Algorithms and Implementation
Sort
View
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 2 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
FLAIRS
2008
13 years 10 months ago
A First-Order Bayesian Tool for Probabilistic Ontologies
One of the major weaknesses of current research on the Semantic Web (SW) is the lack of proper means to represent and reason with uncertainty. A number of recent efforts from the ...
Paulo Cesar G. da Costa, Marcelo Ladeira, Rommel N...
ICWS
2009
IEEE
14 years 4 months ago
RDF Data-Centric Storage
—The vision of the Semantic Web has brought about new challenges at the intersection of web research and data management. One fundamental research issue at this intersection is t...
Justin J. Levandoski, Mohamed F. Mokbel
IUI
2003
ACM
14 years 28 days ago
Towards a theory of natural language interfaces to databases
The need for Natural Language Interfaces to databases (NLIs) has become increasingly acute as more and more people access information through their web browsers, PDAs, and cell ph...
Ana-Maria Popescu, Oren Etzioni, Henry A. Kautz
CAV
1999
Springer
119views Hardware» more  CAV 1999»
13 years 12 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund