Sciweavers

471 search results - page 28 / 95
» Faster Multiplication in GF(2)[x]
Sort
View
HICSS
2007
IEEE
133views Biometrics» more  HICSS 2007»
16 years 16 days ago
Assembling Sensor Networks
Sometimes sensors need to be assembled in response to an emergency. Such assemblage might take a variety of forms. At one extreme, sensors might converge on a single point. At the...
Jeffrey V. Nickerson
IROS
2007
IEEE
99views Robotics» more  IROS 2007»
16 years 15 days ago
Multi-robot routing with rewards and disjoint time windows
Abstract— Multiple robots are often faster and more faulttolerant than single robots for applications such as planetary exploration and search and rescue. We study applications w...
Justin Melvin, Pinar Keskinocak, Sven Koenig, Crai...
ISORC
2007
IEEE
16 years 14 days ago
LSynD: Localized Synopsis Diffusion
Wireless sensor networks represent an extremely fastgrowing emerging technology, but still suffer from several limitations. The state of the art in sensor networks focuses on opti...
Andreea Berfield, Panos K. Chrysanthis, Daniel Mos...
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
16 years 10 days ago
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
Sung Eun Bae, Tadao Takaoka
ISVC
2007
Springer
16 years 10 days ago
Learning to Recognize Complex Actions Using Conditional Random Fields
Surveillance systems that operate continuously generate large volumes of data. One such system is described here, continuously tracking and storing observations taken from multiple...
Christopher I. Connolly