Sciweavers

359 search results - page 19 / 72
» Online Algorithms for Disk Graphs
Sort
View
AAAI
2007
15 years 2 months ago
Parallel Structured Duplicate Detection
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...
Rong Zhou, Eric A. Hansen
107
Voted
INFOCOM
2000
IEEE
15 years 4 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
117
Voted
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
14 years 11 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
135
Voted
ICASSP
2011
IEEE
14 years 3 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
PERCOM
2006
ACM
15 years 11 months ago
Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
Evangelos Kranakis, Tim Mott, Ladislav Stacho