3946 search results - page 294 / 790 » The computational complexity of choice sets |
178
Voted
FSTTCS
2004
Springer
16 years 5 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
187
click to vote
TKDE
2010
15 years 5 months ago
2010
— Tampering of a database can be detected through the use of cryptographically-strong hash functions. Subsequently-applied forensic analysis algorithms can help determine when, w...
208
click to vote
SGAI
2010
Springer
15 years 1 months ago
2010
Springer
: In the present paper we address the problem of computing the Minimal Additional Sensor Sets (MASS) that guarantee a desired level of diagnostic discrimination for a system. Recen...
155
click to vote
ICDCSW
2003
IEEE
16 years 1 days ago
2003
IEEE
Abstract— Today’s complex appliances are plagued by difficultto-use interfaces. In many cases, consumers use only a few of the many features on their appliances because the mor...
163
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...