Sciweavers

693 search results - page 2 / 139
» Categorical Properties of The Complex Numbers
Sort
View
SSDBM
2005
IEEE
218views Database» more  SSDBM 2005»
14 years 1 months ago
The "Best K" for Entropy-based Categorical Data Clustering
With the growing demand on cluster analysis for categorical data, a handful of categorical clustering algorithms have been developed. Surprisingly, to our knowledge, none has sati...
Keke Chen, Ling Liu
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
14 years 2 months ago
Towards Context Aware Food Sales Prediction
Sales prediction is a complex task because of large number of factors affecting the demand. We present a context aware sales prediction approach, which selects the base predictor ...
Indre Zliobaite, Jorn Bakker, Mykola Pechenizkiy
GLOBECOM
2010
IEEE
13 years 4 months ago
Information Epidemics in Complex Networks with Opportunistic Links and Dynamic Topology
Abstract--Wireless networks, especially mobile ad hoc networks (MANET) and cognitive radio networks (CRN), are facing two new challenges beyond traditional random network model: op...
Pin-Yu Chen, Kwang-Cheng Chen
COCOON
2000
Springer
13 years 11 months ago
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
Subhash Khot, Venkatesh Raman
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 1 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf