Sciweavers

1088 search results - page 193 / 218
» Probabilistic query expansion using query logs
Sort
View
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
13 years 10 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
MSS
2005
IEEE
64views Hardware» more  MSS 2005»
14 years 2 months ago
STORAGEDB: Enhancing the Storage Sub-System with DBMS Functionalities
This paper proposes STORAGEDB: a paradigm for implementing storage virtualation using databases. It describes details for storing the logical-to-physical mapping information as ta...
Lin Qiao, Balakrishna R. Iyer, Divyakant Agrawal, ...
WWW
2008
ACM
14 years 9 months ago
Web user de-identification in personalization
It is a kind of privacy infraction in personalized web service if the user profile submitted to one web site transferred to another site without user permission. That can cause th...
Jiaqian Zheng, Jing Yao, Junyu Niu
WWW
2005
ACM
14 years 9 months ago
Association search in semantic web: search + inference
Association search is to search for certain instances in semantic web and then make inferences from and about the instances we have found. In this paper, we propose the problem of...
Bangyong Liang, Jie Tang, Juan-Zi Li
STACS
2001
Springer
14 years 1 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid