Sciweavers

1689 search results - page 76 / 338
» Proximate point searching
Sort
View
CCCG
2008
14 years 11 months ago
Searching for Frequent Colors in Rectangles
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
Marek Karpinski, Yakov Nekrich
COLCOM
2007
IEEE
15 years 4 months ago
Message replication in unstructured peer-to-peer network
—Recently, unstructured peer-to-peer (P2P) applications have become extremely popular. Searching in these networks has been a hot research topic. Flooding-based searching, which ...
Osama Al-Haj Hassan, Lakshmish Ramaswamy
ICPADS
2007
IEEE
15 years 4 months ago
A semantic overlay network for unstructured peer-to-peer protocols
Peer-to-Peer computing has become a popular networking paradigm for file sharing, distributed computing, collaborative working, etc. The widely used unstructured Peer-to-Peer pro...
Junfeng Xie, Zhenhua Li, Guihai Chen
GIR
2006
ACM
15 years 3 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
OZCHI
2006
ACM
15 years 3 months ago
InfoScent evaluator: a semi-automated tool to evaluate semantic appropriateness of hyperlinks in a web site
In this paper, we present InfoScent Evaluator, a tool that automatically evaluates the semantic appropriateness of the descriptions of hyperlinks in web pages. The tool is based o...
Christos Katsanos, Nikolaos K. Tselios, Nikolaos M...