Sciweavers

1568 search results - page 283 / 314
» The problem of examination questions in algorithmics
Sort
View
225
Voted
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
16 years 4 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
ECCV
2000
Springer
15 years 8 months ago
Anti-Faces for Detection
This paper offers a novel detection method, which works well even in the case of a complicated image collection – for instance, a frontal face under a large class of linear tran...
Daniel Keren, Margarita Osadchy, Craig Gotsman
PVLDB
2010
139views more  PVLDB 2010»
14 years 10 months ago
Identifying the Most Influential Data Objects with Reverse Top-k Queries
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 4 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
169
Voted
ICPP
2009
IEEE
15 years 10 months ago
Run to Potential: Sweep Coverage in Wireless Sensor Networks
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...
Min Xi, Kui Wu, Yong Qi, Jizhong Zhao, Yunhao Liu,...