Sciweavers

3680 search results - page 79 / 736
» cases 2010
Sort
View
IEEEHPCS
2010
15 years 4 months ago
Timed protocols insecurity problem is NP-complete
—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rus...
Massimo Benerecetti, Nicola Cuomo, Adriano Peron
TIT
2010
137views Education» more  TIT 2010»
15 years 25 days ago
Stable recovery of sparse signals and an oracle inequality
This article considers sparse signal recovery in the presence of noise. A mutual incoherence condition which was previously used for exact recovery in the noiseless case is shown t...
T. Tony Cai, Lie Wang, Guangwu Xu
TVCG
2010
174views more  TVCG 2010»
15 years 4 months ago
Subdivision Analysis of the Trilinear Interpolant
— Isosurfaces are fundamental volumetric visualization tools, and are generated by the well-known Marching Cubes cases that approximate contours of trilinearly-interpolated scala...
Hamish Carr, Nelson Max
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 3 months ago
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
Abstract. In this paper a tight bound on the worst-case number of comparisons for Floyd's well known heap construction algorithm, is derived. It is shown that at most 2n - 2
Ioannis K. Paparrizos
LREC
2010
183views Education» more  LREC 2010»
15 years 7 months ago
Inferring Subcat Frames of Verbs in Urdu
This paper describes an approach for inferring syntactic frames of verbs in Urdu from an untagged corpus. Urdu, like many other South Asian languages, is a free word order and cas...
Ghulam Raza