20066 search results - page 299 / 4014 » T Spaces |
195
click to vote
STACS
2007
Springer
16 years 26 days 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...
179
click to vote
ICPP
2006
IEEE
16 years 24 days ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
185
click to vote
PODS
2005
ACM
16 years 9 days ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
253
click to vote
ESOP
2004
Springer
16 years 4 days ago
2004
Springer
We show how to combine trust management theories with nonce-based cryptographic protocols. The strand space framework for protocol analysis is extended by associating formulas from...
243
click to vote
CODES
2003
IEEE
16 years 1 days ago
2003
IEEE
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...