Sciweavers

11051 search results - page 2032 / 2211
» An Investigation of Generalized Cases
Sort
View
SPAA
2009
ACM
16 years 7 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
TCC
2009
Springer
132views Cryptology» more  TCC 2009»
16 years 7 months ago
Authenticated Adversarial Routing
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
Yair Amir, Paul Bunn, Rafail Ostrovsky
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 7 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 7 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 7 months ago
A visual-analytic toolkit for dynamic interaction graphs
In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological appli...
Xintian Yang, Sitaram Asur, Srinivasan Parthasarat...
« Prev « First page 2032 / 2211 Last » Next »