1819 search results - page 73 / 364 » Computability and Representations of the Zero Set |
STACS
2007
Springer
15 years 3 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
TCS
2010
14 years 4 months ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
ESORICS
2007
Springer
15 years 4 months ago
2007
Springer
Current trust models enable decision support at an implicit level by means of thresholds or constraint satisfiability. Decision support is mostly included only for a single binary...
WSCG
2004
14 years 11 months ago
2004
This paper compares various techniques for compressing floating point distance fields. Both lossless and lossy techniques are compared against a new lossless technique. The new Ve...
POLICY
2009
Springer
15 years 4 months ago
2009
Springer
Abstract—Zodiac (Zero Outage Dynamic Intrinsically Assurable Communities) is an implementation of a high-security MANET, resistant to multiple types of attacks, including Byzanti...