Sciweavers

2354 search results - page 409 / 471
» Assignment Problems
Sort
View
ITSL
2008
13 years 11 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 10 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICSE
2005
IEEE-ACM
14 years 10 months ago
Re-engineering software architecture of home service robots: a case study
With the advances of robotics, computer science, and other related areas, home service robots attract much attention from both academia and industry. Home service robots consists ...
Moonzoo Kim, Jaejoon Lee, Kyo Chul Kang, Youngjin ...
MOBIHOC
2006
ACM
14 years 9 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
CIDM
2009
IEEE
14 years 4 months ago
An improved multiple minimum support based approach to mine rare association rules
Abstract—In this paper we have proposed an improved approach to extract rare association rules. Rare association rules are the association rules containing rare items. Rare items...
R. Uday Kiran, P. Krishna Reddy