Sciweavers

1243 search results - page 181 / 249
» On the locality of bounded growth
Sort
View
ICASSP
2009
IEEE
16 years 1 months ago
A framework for distributed multimedia stream mining systems using coalition-based foresighted strategies
In this paper, we propose a distributed solution to the problem of configuring classifier trees in distributed stream mining systems. The configuration involves selecting appro...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
ALGOSENSORS
2009
Springer
16 years 1 months ago
Compressing Kinetic Data from Sensor Networks
We introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant...
Sorelle A. Friedler, David M. Mount
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
16 years 29 days ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
16 years 26 days ago
Application of the proximal center decomposition method to distributed model predictive control
Abstract— In this paper we present a dual-based decomposition method, called here the proximal center method, to solve distributed model predictive control (MPC) problems for cou...
Ion Necoara, Dang Doan, Johan A. K. Suykens
INFOCOM
2007
IEEE
16 years 20 days ago
Guaranteed-Delivery Geographic Routing Under Uncertain Node Locations
—Geographic routing protocols like GOAFR or GPSR rely on exact location information at the nodes, because when the greedy routing phase gets stuck at a local minimum, they requir...
Stefan Funke, Nikola Milosavljevic