Sciweavers

1099 search results - page 170 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
CODES
2011
IEEE
14 years 5 months ago
Analysis and optimization of fault-tolerant task scheduling on multiprocessor embedded systems
Reliability is a major requirement for most safety-related systems. To meet this requirement, fault-tolerant techniques such as hardware replication and software re-execution are ...
Jia Huang, Jan Olaf Blech, Andreas Raabe, Christia...
IWCMC
2006
ACM
15 years 12 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
ICCV
2003
IEEE
16 years 8 months ago
3D Tracking = Classification + Interpolation
Hand gestures are examples of fast and complex motions. Computers fail to track these in fast video, but sleight of hand fools humans as well: what happens too quickly we just can...
Carlo Tomasi, Slav Petrov, Arvind Sastry
NPIV
1998
ACM
108views Visualization» more  NPIV 1998»
15 years 10 months ago
Visualization for situation awareness
We explore techniques from visualization and computational geometry to make tactical information more intuitive to a military commander. To be successful, the commander must quick...
C. M. Hoffman, Y.-J. Kim, R. P. Winkler, J. D. Wal...
MOBIHOC
2002
ACM
16 years 5 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder