4526 search results - page 140 / 906 » Algorithmic problems related to the Internet |
138
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
174
click to vote
PODS
2012
ACM
13 years 6 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
126
click to vote
EPEW
2008
Springer
15 years 6 months ago
2008
Springer
The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems ...
143
click to vote
CIAC
2010
Springer
16 years 1 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
117
click to vote
WISE
2006
Springer
15 years 10 months ago
2006
Springer
Frequent embedded subtree pattern mining is an important data mining problem with broad applications. In this paper, we propose a novel embedded subtree mining algorithm, called Pr...