Sciweavers

2830 search results - page 199 / 566
» No Science without Semantics
Sort
View
FQAS
2009
Springer
127views Database» more  FQAS 2009»
14 years 4 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 3 months ago
Ranking Query Results using Context-Aware Preferences
To better serve users’ information needs without requiring comprehensive queries from users, a simple yet effective technique is to explore the preferences of users. Since these...
Arthur H. van Bunningen, Maarten M. Fokkinga, Pete...
ESWS
2007
Springer
14 years 3 months ago
Minimal Deductive Systems for RDF
Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
Sergio Muñoz, Jorge Pérez, Claudio G...
ICMCS
2006
IEEE
111views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Probabilistic Multimodality Fusion for Event based Home Photo Clustering
This paper presents a novel probabilistic approach to fusing multimodal metadata for event based home photo clustering. Photo events are characterized by the coherence of multimod...
Tao Mei, Bin Wang, Xian-Sheng Hua, He-Qin Zhou, Sh...
ASWEC
2005
IEEE
14 years 3 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...