Sciweavers

955 search results - page 159 / 191
» Cover Set Problem in Directional Sensor Networks
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
GLOBECOM
2009
IEEE
15 years 4 months ago
Data Acquisition through Joint Compressive Sensing and Principal Component Analysis
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
Riccardo Masiero, Giorgio Quer, Daniele Munaretto,...
92
Voted
NN
1998
Springer
151views Neural Networks» more  NN 1998»
14 years 9 months ago
Evolutionary neurocontrollers for autonomous mobile robots
In this article we describe a methodology for evolving neurocontrollers of autonomous mobile robots without human intervention. The presentation, which spans from technological an...
Dario Floreano, Francesco Mondada
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
15 years 11 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
SPAA
1999
ACM
15 years 2 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...