Sciweavers

15254 search results - page 20 / 3051
» A k
Sort
View
MDM
2010
Springer
281views Communications» more  MDM 2010»
15 years 1 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...
ICDE
2007
IEEE
115views Database» more  ICDE 2007»
16 years 1 months ago
MultiRelational k-Anonymity
k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much...
Mehmet Ercan Nergiz, Chris Clifton, A. Erhan Nergi...
WWW
2006
ACM
16 years 13 days ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
16 years 2 days ago
Lower bounds for k-DNF resolution on random 3-CNFs
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
Michael Alekhnovich
WCNC
2008
IEEE
15 years 6 months ago
Simulation of Doubly-Selective Compound K Fading Channels for Mobile-to-Mobile Communications
A computer simulation model is proposed for discretetime doubly-selective compound-K fading channel. It first generates multiple independent mobile-to-mobile Rayleigh fading Chan...
Yuan Liu, Jian Zhang, Yahong Rosa Zheng