Sciweavers

15254 search results - page 93 / 3051
» A k
Sort
View
PEWASUN
2008
ACM
14 years 11 months ago
An efficient anycast scheme for discovering K services in mobile ad-hoc networks
Pei-Jung Lin, Chyi-Ren Dow, Sheng-Chang Chen, Chia...
DMIN
2006
134views Data Mining» more  DMIN 2006»
14 years 11 months ago
Hyper-Rectangular and k-Nearest-Neighbor Models in Stochastic Discrimination
The stochastic discrimination (SD) theory considers learning as building models of uniform coverage over data distributions. Despite successful trials of the derived SD method in s...
Iryna Skrypnyk, Tin Kam Ho
ALENEX
2003
173views Algorithms» more  ALENEX 2003»
14 years 11 months ago
Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation
John Hershberger, Matthew Maxel, Subhash Suri
APPINF
2003
14 years 11 months ago
Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
Gur Saran Adhar