Sciweavers

12052 search results - page 459 / 2411
» computing 2010
Sort
View
ENTCS
2002
76views more  ENTCS 2002»
15 years 6 months ago
Feasible functionals and intersection of ramified types
We show that the basic feasible functions of Cook and Urquhart's BFF [8,9] are precisely the functionals definable in a natural system of ramified recurrence that uses type i...
Daniel Leivant
IGARSS
2010
15 years 4 months ago
Using Gradient Pattern Analysis for land use and land cover change detection
In this work, the computational operation based on Gradient Pattern Analysis - GPA was applied for the first time in MODIS spatial-temporal images over the Amazon region. The stud...
Ramon Morais de Freitas, Reinaldo R. Rosa, Yosio E...
CMPB
2010
119views more  CMPB 2010»
15 years 4 months ago
Estimation of coefficients of individual agreement (CIAs) for quantitative and binary data using SAS and R
: The coefficients of individual agreement (CIA's), which are based on the ratio of the intra- and inter-observer disagreement, provide a general approach for evaluating agree...
Yi Pan, Jingjing Gao, Michael Haber, Huiman X. Bar...
IJACT
2010
103views more  IJACT 2010»
15 years 1 months ago
On reusing ephemeral keys in Diffie-Hellman key agreement protocols
A party may choose to reuse ephemeral public keys in a Diffie-Hellman key agreement protocol in order to reduce its computational workload or to mitigate against denial-of-service ...
Alfred Menezes, Berkant Ustaoglu
172
Voted
JMLR
2010
115views more  JMLR 2010»
15 years 1 months ago
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
Nic Schraudolph