163 search results - page 16 / 33 » Improving the Context-sensitive Dependency Graph |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
CN
2008
13 years 7 months ago
2008
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
MICAI
2010
Springer
13 years 6 months ago
2010
Springer
We argue for that taking into account semantic relations between words in the text can improve information retrieval performance. We implemented the process of information retrieva...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...