Sciweavers

3020 search results - page 302 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
AAAI
2008
15 years 9 months ago
Existentially Quantified Values for Queries and Updates of Facts in Transaction Logic Programs
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
Paul Fodor
WWW
2006
ACM
16 years 7 months ago
Knowledge modeling and its application in life sciences: a tale of two ontologies
High throughput glycoproteomics, similar to genomics and proteomics, involves extremely large volumes of distributed, heterogeneous data as a basis for identification and quantifi...
Satya Sanket Sahoo, Christopher Thomas, Amit P. Sh...
WWW
2008
ACM
16 years 7 months ago
Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web
Easy reuse and integration of declaratively described information in a distributed setting is one of the main motivations for building the Semantic Web. Despite of this claim, reu...
Simon Schenk, Steffen Staab
ICML
2004
IEEE
16 years 7 months ago
Learning first-order rules from data with multiple parts: applications on mining chemical compound data
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
Cholwich Nattee, Sukree Sinthupinyo, Masayuki Numa...
PODS
2006
ACM
216views Database» more  PODS 2006»
16 years 7 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...