Sciweavers

350 search results - page 22 / 70
» Separation of Partition Inequalities
Sort
View
JDCTA
2010
152views more  JDCTA 2010»
13 years 2 months ago
Spatial Clustering Algorithm Based on Hierarchical-Partition Tree
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
Zhongzhi Li, Xuegang Wang
AINA
2007
IEEE
14 years 2 months ago
Conflict Free Address Allocation Mechanism for Mobile Ad Hoc Networks
A Mobile Ad-hoc Network (MANET) can be implemented anywhere where there is little or no communication infrastructure, or the existing infrastructure is inconvenient to use. A numb...
Sudath Indrasinghe, Rubem Pereira, John Haggerty
DM
2008
69views more  DM 2008»
13 years 8 months ago
New identities for 7-cores with prescribed BG-rank
Let be a partition. BG-rank() is defined as an alternating sum of parities of parts of [1]. In [2], Berkovich and Garvan found theta series representations for the t-core generat...
Alexander Berkovich, Hamza Yesilyurt
ADC
2007
Springer
145views Database» more  ADC 2007»
14 years 2 months ago
The Privacy of k-NN Retrieval for Horizontal Partitioned Data -- New Methods and Applications
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
Artak Amirbekyan, Vladimir Estivill-Castro
WINE
2007
Springer
151views Economy» more  WINE 2007»
14 years 2 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...