Sciweavers

4850 search results - page 94 / 970
» Approximate Data Structures with Applications
Sort
View
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 7 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
15 years 10 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer
CG
2007
Springer
14 years 10 months ago
Visualizing and animating the winged-edge data structure
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
Bryan Neperud, John L. Lowther, Ching-Kuang Shene
KDD
2002
ACM
193views Data Mining» more  KDD 2002»
15 years 10 months ago
Query, analysis, and visualization of hierarchically structured data using Polaris
In the last several years, large OLAP databases have become common in a variety of applications such as corporate data warehouses and scientific computing. To support interactive ...
Chris Stolte, Diane Tang, Pat Hanrahan
ACML
2009
Springer
15 years 4 months ago
Injecting Structured Data to Generative Topic Model in Enterprise Settings
Enterprises have accumulated both structured and unstructured data steadily as computing resources improve. However, previous research on enterprise data mining often treats these ...
Han Xiao, Xiaojie Wang, Chao Du