Sciweavers

2805 search results - page 259 / 561
» Collecting More Garbage
Sort
View
ICIP
2007
IEEE
16 years 1 months ago
Locally Competitive Algorithms for Sparse Approximation
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
ICRA
2007
IEEE
129views Robotics» more  ICRA 2007»
16 years 29 days ago
Scene Matching between a Map and a Hand Drawn Sketch Using Spatial Relations
—The goal of this work is to determine the object correspondence between a sketched map and the scene depicted by the sketch, e.g., as represented by an occupancy grid map (OGM) ...
Gaurav Parekh, Marjorie Skubic, Ozy Sjahputera, Ja...
IROS
2007
IEEE
97views Robotics» more  IROS 2007»
16 years 29 days ago
Meld: A declarative approach to programming ensembles
Abstract— This paper presents Meld, a programming language for modular robots, i.e., for independently executing robots where inter-robot communication is limited to immediate ne...
Michael P. Ashley-Rollman, Seth Copen Goldstein, P...
RTSS
2007
IEEE
16 years 28 days ago
Distributed Minimal Time Convergecast Scheduling for Small or Sparse Data Sources
— Many applications of sensor networks require the base station to collect all the data generated by sensor nodes. As a consequence many-to-one communication pattern, referred to...
Ying Zhang, Shashidhar Gandham, Qingfeng Huang
WIMOB
2007
IEEE
16 years 28 days ago
A Gossip Protocol to Support Service Discovery with Heterogeneous Ontologies in MANETs
Service discovery in mobile ad hoc networks (MANETs) is an integral part for collective application interoperability. The discovery process must cope not only with transient commun...
Andronikos Nedos, Kulpreet Singh, Raymond Cunningh...