Sciweavers

203 search results - page 25 / 41
» Exponentiable morphisms of domains
Sort
View
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
14 years 8 months ago
A framework for ontology-driven subspace clustering
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
Jinze Liu, Wei Wang 0010, Jiong Yang
BMCBI
2005
77views more  BMCBI 2005»
13 years 7 months ago
Structural comparison of metabolic networks in selected single cell organisms
Background: There has been tremendous interest in the study of biological network structure. An array of measurements has been conceived to assess the topological properties of th...
Dongxiao Zhu, Zhaohui S. Qin
ICDE
2004
IEEE
121views Database» more  ICDE 2004»
14 years 9 months ago
Online Amnesic Approximation of Streaming Time Series
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractic...
Themistoklis Palpanas, Michail Vlachos, Eamonn J. ...
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 7 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
CP
2005
Springer
14 years 1 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell