Sciweavers

3384 search results - page 674 / 677
» More Testable Properties
Sort
View
CGF
2011
12 years 11 months ago
Prior Knowledge for Part Correspondence
Classical approaches to shape correspondence base their computation purely on the properties, in particular geometric similarity, of the shapes in question. Their performance stil...
Oliver van Kaick, Andrea Tagliasacchi, Oana Sidi, ...
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
12 years 11 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
FOSSACS
2011
Springer
12 years 11 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
INFOCOM
2011
IEEE
12 years 11 months ago
Adaptive algorithms for detecting community structure in dynamic social networks
—Social networks exhibit a very special property: community structure. Understanding the network community structure is of great advantages. It not only provides helpful informat...
Nam P. Nguyen, Thang N. Dinh, Ying Xuan, My T. Tha...
MSR
2011
ACM
12 years 10 months ago
Do time of day and developer experience affect commit bugginess
Modern software is often developed over many years with hundreds of thousands of commits. Commit metadata is a rich source of social characteristics, including the commit’s time...
Jon Eyolfson, Lin Tan, Patrick Lam