Sciweavers

925 search results - page 128 / 185
» Connectivity on Complete Lattices
Sort
View
UIC
2007
Springer
15 years 6 months ago
Self-deployment of Mobile Nodes in Hybrid Sensor Networks by AHP
Abstract. The proper deployment of sensors is very important for the successful completion of the sensing tasks due to the inevitable relation with the physical world. This paper p...
Xiaoling Wu, Jinsung Cho, Brian J. d'Auriol, Sungy...
AICT
2006
IEEE
15 years 6 months ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
GLOBECOM
2006
IEEE
15 years 6 months ago
Content Delivery in Overlay Networks: a Stochastic Graph Processes Perspective
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
15 years 6 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
ISCAS
2006
IEEE
90views Hardware» more  ISCAS 2006»
15 years 5 months ago
Feature competition in a spike-based winner-take-all VLSI network
— Recurrent networks and hardware analogs that perform a winner-take-all computation have been studied extensively. This computation is rarely demonstrated in a spiking network o...
Shih-Chii Liu, Matthias Oster