Sciweavers

382 search results - page 3 / 77
» Ranking Approximate Answers to Semantic Web Queries
Sort
View
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
13 years 11 months ago
Searching and Ranking Documents based on Semantic Relationships
Just as the link structure of the web is a critical component in today's web search, complex relationships (i.e., the different ways the dots are connected) will be an import...
Boanerges Aleman-Meza
AAAI
2007
13 years 7 months ago
Approximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
Jeff Z. Pan, Edward Thomas
SIGMOD
2008
ACM
118views Database» more  SIGMOD 2008»
13 years 4 months ago
NAGA: harvesting, searching and ranking knowledge
The presence of encyclopedic Web sources, such as Wikipedia, the Internet Movie Database (IMDB), World Factbook, etc. calls for new querying techniques that are simple and yet mor...
Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifr...
SCCC
1997
IEEE
13 years 9 months ago
Reactive Ranking for Cooperative Databases
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
Berthier A. Ribeiro-Neto, Guilherme T. de Assis
SEMCO
2008
IEEE
13 years 11 months ago
Semantic Search Meets the Web
While semantic search technologies have been proven to work well in specific domains, they still have to confront two main challenges to scale up to the Web in its entirety. In th...
Miriam Fernández, Vanessa Lopez, Marta Sabo...