Sciweavers

4526 search results - page 362 / 906
» Algorithmic problems related to the Internet
Sort
View
PODC
2005
ACM
16 years 9 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
WWW
2007
ACM
16 years 7 months ago
Navigating the intranet with high precision
Despite the success of web search engines, search over large enterprise intranets still suffers from poor result quality. Earlier work [6] that compared intranets and the Internet...
Huaiyu Zhu, Sriram Raghavan, Shivakumar Vaithyanat...
IPL
2008
80views more  IPL 2008»
15 years 6 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
15 years 5 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
FSTTCS
2008
Springer
15 years 7 months ago
STCON in Directed Unique-Path Graphs
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
Sampath Kannan, Sanjeev Khanna, Sudeepa Roy