Sciweavers

707 search results - page 101 / 142
» Solving path problems on the GPU
Sort
View
ICASSP
2010
IEEE
15 years 11 hour ago
Graph based event detection from realistic videos using weak feature correspondence
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very ...
Lei Ding, Quanfu Fan, Jen-Hao Hsiao, Sharath Panka...
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
14 years 11 months ago
Optimized on Demand Routing Protocol of Mobile Ad Hoc Network
In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by ...
Chinnappan Jayakumar, Chenniappan Chellappan
JSW
2007
118views more  JSW 2007»
14 years 11 months ago
A New Formalism for Failure Diagnosis: Ant Colony Decision Petri Nets
— Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A clas...
Calin Ciufudean, Adrian Graur, Constantin Filote, ...
CCR
2000
75views more  CCR 2000»
14 years 11 months ago
The Eifel algorithm: making TCP robust against spurious retransmissions
We propose an enhancement to TCP's error recovery scheme, which we call the Eifel algorithm. It eliminates the retransmission ambiguity, thereby solving the problems caused b...
Reiner Ludwig, Randy H. Katz
ESA
2010
Springer
188views Algorithms» more  ESA 2010»
14 years 9 months ago
Contractions of Planar Graphs in Polynomial Time
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
Marcin Kaminski, Daniël Paulusma, Dimitrios M...