Sciweavers

514 search results - page 26 / 103
» Packet Classification Algorithms: From Theory to Practice
Sort
View
122
Voted
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 1 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
113
Voted
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 3 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
131
Voted
CVPR
2010
IEEE
15 years 11 months ago
Specular Surface Reconstruction from Sparse Reflection Correspondences
We present a practical approach for surface reconstruction of smooth mirror-like objects using sparse reflection correspondences (RCs). Assuming finite object motion with a fix...
Aswin Sankaranarayanan, Ashok Veeraraghavan, Oncel...
161
Voted
TWC
2008
135views more  TWC 2008»
15 years 3 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
119
Voted
CORR
2010
Springer
60views Education» more  CORR 2010»
15 years 3 months ago
A Novel Scheme for Secured Data Transfer Over Computer Networks
: This paper presents a novel encryption-less algorithm to enhance security in transmission of data in networks. The algorithm uses an intuitively simple idea of a `jigsaw puzzle&#...
Rangarajan Vasudevan, Ajith Abraham, Sugata Sanyal