Sciweavers

721 search results - page 16 / 145
» Graphs with Large Obstacle Numbers
Sort
View
AIRS
2008
Springer
14 years 4 months ago
On the Construction of a Large Scale Chinese Web Test Collection
The lack of a large scale Chinese test collection is an obstacle to the Chinese information retrieval development. In order to address this issue, we built such a collection compos...
Hongfei Yan, Chong Chen, Bo Peng, Xiaoming Li
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
14 years 11 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
DASFAA
2010
IEEE
224views Database» more  DASFAA 2010»
14 years 2 months ago
Dynamic Skyline Queries in Large Graphs
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
INFOCOM
2006
IEEE
14 years 3 months ago
Sampling Techniques for Large, Dynamic Graphs
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...