Sciweavers

649 search results - page 126 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
ICEIS
2005
IEEE
14 years 1 months ago
Conditions for Interoperability
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
B. Nick Rossiter, Michael A. Heather
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 7 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
MOBISYS
2006
ACM
14 years 7 months ago
LIGER: implementing efficient hybrid security mechanisms for heterogeneous sensor networks
The majority of security schemes available for sensor networks assume deployment in areas without access to a wired infrastructure. More specifically, nodes in these networks are ...
Patrick Traynor, Raju Kumar, Hussain Bin Saad, Guo...
INFOCOM
2007
IEEE
14 years 1 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
IPPS
2010
IEEE
13 years 5 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...