Sciweavers

730 search results - page 83 / 146
» Combinatorics of Monotone Computations
Sort
View
ICDM
2003
IEEE
130views Data Mining» more  ICDM 2003»
15 years 11 months ago
Information Theoretic Clustering of Sparse Co-Occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Inderjit S. Dhillon, Yuqiang Guan
ICDM
2002
IEEE
139views Data Mining» more  ICDM 2002»
15 years 11 months ago
An Incremental Approach to Building a Cluster Hierarchy
In this paper we present a novel Incremental Hierarchical Clustering (IHC) algorithm. Our approach aims to construct a hierarchy that satisfies the homogeneity and the monotonici...
Dwi H. Widyantoro, Thomas R. Ioerger, John Yen
GLOBE
2009
Springer
15 years 10 months ago
Designing, Specifying and Querying Metadata for Virtual Data Integration Systems
Abstract. We show how to specify and use the metadata for a virtual and relational data integration system under the local-as-view (LAV) approach. We use XML and RuleML for represe...
Leopoldo E. Bertossi, Gayathri Jayaraman
GLOBECOM
2007
IEEE
15 years 10 months ago
Bursty Traffic in Energy-Constrained Opportunistic Spectrum Access
We design opportunistic spectrum access strategies for improving spectrum efficiency. In each slot, a secondary user chooses a subset of channels to sense and decides whether to ac...
Yunxia Chen, Qing Zhao, Ananthram Swami
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 10 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...