Sciweavers

2745 search results - page 399 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
MOBIDE
2006
ACM
15 years 10 months ago
GPS-Free node localization in mobile wireless sensor networks
An important problem in mobile ad-hoc wireless sensor networks is the localization of individual nodes, i.e., each node’s awareness of its position relative to the network. In t...
Hüseyin Akcan, Vassil Kriakov, Hervé B...
MOBICOM
2005
ACM
15 years 10 months ago
Using mobile relays to prolong the lifetime of wireless sensor networks
In this paper we investigate the benefits of a heterogeneous architecture for wireless sensor networks composed of a few resource rich mobile nodes and a large number of simple s...
Wei Wang 0002, Vikram Srinivasan, Kee Chaing Chua
MSWIM
2004
ACM
15 years 10 months ago
Mobile dynamic content distribution networks
Mobile networks are becoming increasingly popular as a means for distributing information to a large number of users. In comparison to wired networks, mobile networks are distingu...
Wagner Moro Aioffi, Geraldo Robson Mateus, Jussara...
WSDM
2012
ACM
325views Data Mining» more  WSDM 2012»
14 years 11 days ago
Coupled temporal scoping of relational facts
Recent research has made significant advances in automatically constructing knowledge bases by extracting relational facts (e.g., Bill Clinton-presidentOf-US) from large text cor...
Partha Pratim Talukdar, Derry Tanti Wijaya, Tom Mi...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 10 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál