Sciweavers

130 search results - page 23 / 26
» Algorithms for Finding a Most Similar Subforest
Sort
View
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
15 years 9 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
ANSS
2006
IEEE
15 years 3 months ago
Performance Study of End-to-End Traffic-Aware Routing
There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider findi...
Raad S. Al-Qassas, Lewis M. Mackenzie, Mohamed Oul...
IWCMC
2010
ACM
14 years 11 months ago
Decentralized service composition in pervasive computing environments
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...
TREC
2001
14 years 11 months ago
Link-based Approaches for Text Retrieval
We assess a family of ranking mechanisms for search engines based on linkage analysis using a carefully engineered subset of the World Wide Web, WT10g (Bailey, Craswell and Hawking...
Julien Gevrey, Stefan M. Rüger
IUI
2010
ACM
15 years 4 months ago
DocuBrowse: faceted searching, browsing, and recommendations in an enterprise context
Browsing and searching for documents in large, online enterprise document repositories are common activities. While internet search produces satisfying results for most user queri...
Andreas Girgensohn, Frank M. Shipman III, Francine...