Sciweavers

11211 search results - page 165 / 2243
» Data Structures
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 6 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
ICDM
2003
IEEE
138views Data Mining» more  ICDM 2003»
15 years 11 months ago
PixelMaps: A New Visual Data Mining Approach for Analyzing Large Spatial Data Sets
PixelMaps are a new pixel-oriented visual data mining technique for large spatial datasets. They combine kerneldensity-based clustering with pixel-oriented displays to emphasize c...
Daniel A. Keim, Christian Panse, Mike Sips, Stephe...
IDA
2009
Springer
15 years 11 months ago
Visualization-Driven Structural and Statistical Analysis of Turbulent Flows
Knowledge extraction from data volumes of ever increasing size requires ever more flexible tools to facilitate interactive query. Interactivity enables real-time hypothesis testin...
Kenny Gruchalla, Mark Rast, Elizabeth Bradley, Joh...
ICML
2007
IEEE
16 years 7 months ago
Dynamic hierarchical Markov random fields and their application to web data extraction
Hierarchical models have been extensively studied in various domains. However, existing models assume fixed model structures or incorporate structural uncertainty generatively. In...
Jun Zhu, Zaiqing Nie, Bo Zhang, Ji-Rong Wen
SIGOPS
2010
171views more  SIGOPS 2010»
15 years 4 months ago
Cassandra: a decentralized structured storage system
Cassandra is a distributed storage system for managing very large amounts of structured data spread out across many commodity servers, while providing highly available service wit...
Avinash Lakshman, Prashant Malik