Sciweavers

3384 search results - page 134 / 677
» More Testable Properties
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 7 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
ECCC
2010
83views more  ECCC 2010»
13 years 7 months ago
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Σk-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who co...
Maurice Jansen, Youming Qiao, Jayalal M. N. Sarma
ICCV
2011
IEEE
12 years 9 months ago
Relative Attributes
Human-nameable visual “attributes” can benefit various recognition tasks. However, existing techniques restrict these properties to categorical labels (for example, a person ...
Devi Parikh, Kristen Grauman
CHES
2011
Springer
254views Cryptology» more  CHES 2011»
12 years 9 months ago
Extractors against Side-Channel Attacks: Weak or Strong?
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
Marcel Medwed, François-Xavier Standaert
COMPSYSTECH
2011
12 years 8 months ago
Encoding watermark numbers as cographs using self-inverting permutations
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
Maria Chroni, Stavros D. Nikolopoulos