Sciweavers

583 search results - page 2 / 117
» Computing Linking Numbers of a Filtration
Sort
View
TCOM
2011
94views more  TCOM 2011»
13 years 1 months ago
Protection Against Link Errors and Failures Using Network Coding
—We propose a network-coding based scheme to protect multiple bidirectional unicast connections against adversarial errors and failures in a network. The end nodes of the bidirec...
Shizheng Li, Aditya Ramamoorthy
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
13 years 10 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
NAR
2011
208views Computer Vision» more  NAR 2011»
12 years 9 months ago
CaSNP: a database for interrogating copy number alterations of cancer genome from SNP array data
Cancer is known to have abundant copy number alterations (CNAs) that greatly contribute to its pathogenesis and progression. Investigation of CNA regions could potentially help id...
Qingyi Cao, Meng Zhou, Xujun Wang, Clifford A. Mey...
TON
2002
99views more  TON 2002»
13 years 5 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
COCOON
2008
Springer
13 years 8 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen