Sciweavers

2969 search results - page 128 / 594
» A space efficient algorithm for group structure computation
Sort
View
128
Voted
IC
2004
15 years 4 months ago
Area-Efficient Visualization of Web Data
With the explosion of the Internet the World Wide Web today has become an infinite source of information. Hence, it is important that one be able to categorize, understand and be a...
Vishal Anand, Keith Hansen, Radu Jianu, Adrian Rus...
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
15 years 1 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
231
Voted
VLDB
2007
ACM
179views Database» more  VLDB 2007»
16 years 3 months ago
Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data
Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time a...
Xiaolei Li, Jiawei Han
120
Voted
CORR
2000
Springer
81views Education» more  CORR 2000»
15 years 3 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
PG
2003
IEEE
15 years 8 months ago
Adaptive Grouping and Subdivision for Simulating Hair Dynamics
We present a novel approach for adaptively grouping and subdividing hair using discrete level-of-detail (LOD) representations. The set of discrete LODs include hair strands, clust...
Kelly Ward, Ming C. Lin