Sciweavers

1241 search results - page 122 / 249
» Path-oriented random testing
Sort
View
INFOCOM
2008
IEEE
15 years 11 months ago
MPLOT: A Transport Protocol Exploiting Multipath Diversity Using Erasure Codes
—In this paper, we propose a novel transport protocol that effectively utilizes available bandwidth and diversity gains provided by heterogeneous, highly lossy paths. Our Multi-P...
Vicky Sharma, Shivkumar Kalyanaraman, Koushik Kar,...
GD
2004
Springer
15 years 10 months ago
Convex Drawings of 3-Connected Plane Graphs
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
WSC
1997
15 years 6 months ago
Applications of Discrete Event Simulation in the Design of Automotive Powertrain Manufacturing Systems
Manufacturing automotive powertrain components (engines and transmissions) is a complex task involving the integration of hundreds of components. Simulation is commonly applied in...
Arun Jayaraman, Ali K. Gunal
ECCV
2010
Springer
15 years 6 months ago
Semantic Segmentation of Urban Scenes Using Dense Depth Maps
In this paper we present a framework for semantic scene parsing and object recognition based on dense depth maps. Five viewindependent 3D features that vary with object class are e...
Chenxi Zhang, Liang Wang, Ruigang Yang
132
Voted
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 5 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys