Sciweavers

779 search results - page 62 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
ICDE
2011
IEEE
224views Database» more  ICDE 2011»
12 years 11 months ago
SmartTrace: Finding similar trajectories in smartphone networks without disclosing the traces
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
Costandinos Costa, Christos Laoudias, Demetrios Ze...
COMCOM
2008
83views more  COMCOM 2008»
13 years 7 months ago
Hierarchical multidimensional search in peer-to-peer networks
We propose a P2P search solution, called EZSearch, that enables efficient multidimensional search for remotely located contents that best match the search criteria. EZSearch is a h...
Duc A. Tran, T. Nguyen
SAC
2010
ACM
14 years 2 months ago
Applying taxonomic knowledge to Bayesian belief network for personalized search
Keyword-based search returns its results without concern for the information needs of users at a particular time. In general, search queries are too short to represent what users ...
Jae-won Lee, Han-joon Kim, Sang-goo Lee
HT
2009
ACM
14 years 2 months ago
Sixearch.org 2.0 peer application for collaborative web search
Sixearch.org is a peer application for social, distributed, adaptive Web search, which integrates the Sixearch.org protocol, a topical crawler, a document indexing system, a retri...
Namrata Lele, Le-Shin Wu, Ruj Akavipat, Filippo Me...
INFOCOM
2009
IEEE
14 years 2 months ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach