Sciweavers

635 search results - page 126 / 127
» Four states are enough!
Sort
View
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 4 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
ESEM
2010
ACM
13 years 4 months ago
Strengthening the empirical analysis of the relationship between Linus' Law and software security
Open source software is often considered to be secure because large developer communities can be leveraged to find and fix security vulnerabilities. Eric Raymond states Linus’ L...
Andrew Meneely, Laurie A. Williams
VTC
2010
IEEE
201views Communications» more  VTC 2010»
13 years 4 months ago
iTETRIS: Adaptation of ITS Technologies for Large Scale Integrated Simulation
1 —the European Union (EU) Framework Program 7 (FP7) funded project, iTETRIS [1] (An Integrated Wireless and Traffic Platform for Real-Time Road Traffic Management Solutions) tar...
Vineet Kumar, Lan Lin, Daniel Krajzewicz, Fatma Hr...
IMC
2010
ACM
13 years 4 months ago
Measurement of loss pairs in network paths
Loss-pair measurement was proposed a decade ago for discovering network path properties, such as a router's buffer size. A packet pair is regarded as a loss pair if exactly o...
Edmond W. W. Chan, Xiapu Luo, Weichao Li, Waiting ...
CVPR
2011
IEEE
13 years 1 months ago
action recognition by dense trajectories
Feature trajectories have shown to be efficient for representing videos. Typically, they are extracted using the KLT tracker or matching SIFT descriptors between frames. However,...
Heng Wang, Alexander Kläser, Cordelia Schmid, Che...