Sciweavers

950 search results - page 129 / 190
» Modified global k
Sort
View
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 4 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
IPPS
2003
IEEE
14 years 3 months ago
Implementation of a Calendar Application Based on SyD Coordination Links
System on Devices (SyD) is a specification for a middleware to enable heterogeneous collections of information, databases, or devices (such as hand-held devices) to collaborate wi...
Sushil K. Prasad, Anu G. Bourgeois, Erdogan Dogdu,...
COCOS
2003
Springer
139views Optimization» more  COCOS 2003»
14 years 3 months ago
Inter-block Backtracking: Exploiting the Structure in Continuous CSPs
This paper details a technique, called inter-block backtracking (IBB), which improves interval solving of decomposed systems with non-linear equations over the reals. This techniqu...
Bertrand Neveu, Christophe Jermann, Gilles Trombet...
SIGMOD
2010
ACM
184views Database» more  SIGMOD 2010»
14 years 2 months ago
Load-balanced query dissemination in privacy-aware online communities
We propose a novel privacy-preserving distributed infrastructure in which data resides only with the publishers owning it. The infrastructure disseminates user queries to publishe...
Emiran Curtmola, Alin Deutsch, K. K. Ramakrishnan,...
SIROCCO
2007
13 years 11 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...