Sciweavers

8825 search results - page 332 / 1765
» All for one or one for all
Sort
View
COLT
2003
Springer
15 years 7 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
CP
2003
Springer
15 years 7 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano
CRYPTO
2003
Springer
96views Cryptology» more  CRYPTO 2003»
15 years 7 months ago
Scalable Protocols for Authenticated Group Key Exchange
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have bee...
Jonathan Katz, Moti Yung
113
Voted
DEXA
2003
Springer
193views Database» more  DEXA 2003»
15 years 7 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
ICCS
2003
Springer
15 years 7 months ago
Generalization of the Fast Consistency Algorithm to a Grid with Multiple High Demand Zones
Abstract. One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and del...
Jesús Acosta-Elías, Leandro Navarro-...