2168 search results - page 373 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
158
Voted
CIG
2005
IEEE
15 years 9 months ago
2005
IEEE
Several attempts have been made in the past to construct encoding schemes that allow modularity to emerge in evolving systems, but success is limited. We believe that in order to c...
130
click to vote
QEST
2008
IEEE
15 years 10 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
134
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
186
click to vote
POPL
2012
ACM
13 years 11 months ago
2012
ACM
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
157
Voted
MIDDLEWARE
2005
Springer
15 years 9 months ago
2005
Springer
With the advancement of technology in micro-electronics and wireless communication, small miniature devices called sensor nodes can be used to perform various tasks by forming the...