Sciweavers

387 search results - page 14 / 78
» Reasoning About Approximate Match Query Results
Sort
View
TCOS
2010
13 years 7 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
CIKM
2007
Springer
14 years 2 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
ESWS
2008
Springer
13 years 10 months ago
Semantic Reasoning: A Path to New Possibilities of Personalization
Abstract. Recommender systems face up to current information overload by selecting automatically items that match the personal preferences of each user. The so-called content-based...
Yolanda Blanco-Fernández, José J. Pa...
DEXA
2009
Springer
153views Database» more  DEXA 2009»
14 years 15 days ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
ICDE
2006
IEEE
208views Database» more  ICDE 2006»
14 years 2 months ago
Approximate Video Search Based on Spatio-Temporal Information of Video Objects
The spatio-temporal information of a video object is important for content-based video retrieval. In this paper the spatio-temporal information of a video object, such as the velo...
Chia-Han Lin, Arbee L. P. Chen