Sciweavers

4679 search results - page 289 / 936
» Modeling When Connections Are the Problem
Sort
View
ESA
2010
Springer
136views Algorithms» more  ESA 2010»
15 years 7 months ago
Fast Minor Testing in Planar Graphs
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignas...
ICUMT
2009
15 years 4 months ago
Coverage and adaptive scheduling algorithms for criticality management on video wireless sensor networks
In WSN-based surveillance systems power conservation is an important issue but one must also ensure that the application's objectives are met. In this paper, we jointly addres...
Abdallah Makhoul, Rachid Saadi, CongDuc Pham
ICICS
2005
Springer
16 years 4 days ago
Batching SSL/TLS Handshake Improved
Secure socket layer (SSL) is the most popular protocol to secure Internet communications. Since SSL handshake requires a large amount of computational resource, batch RSA was propo...
Fang Qi, Weijia Jia, Feng Bao, Yongdong Wu
PADS
2003
ACM
15 years 12 months ago
Power-aware State Dissemination in Mobile Distributed Virtual Environments
In distributed simulations, such as multi-player distributed virtual environments (DVE), power consumption traditionally has not been a major design factor. However, emerging batt...
Weidong Shi, Kalyan S. Perumalla, Richard M. Fujim...
FCCM
2000
IEEE
103views VLSI» more  FCCM 2000»
15 years 11 months ago
A Networked FPGA-Based Hardware Implementation of a Neural Network Application
This paper describes a networked FPGA-based implementation of the FAST (Flexible Adaptable-Size Topology) architecture, a Arti cial Neural Network (ANN) that dynamically adapts it...
Héctor Fabio Restrepo, Ralph Hoffmann, Andr...