Sciweavers

3360 search results - page 419 / 672
» Opportunistic Data Structures with Applications
Sort
View
CIKM
2008
Springer
15 years 7 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...
SDM
2010
SIAM
182views Data Mining» more  SDM 2010»
15 years 6 months ago
HCDF: A Hybrid Community Discovery Framework
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...
Keith Henderson, Tina Eliassi-Rad, Spiros Papadimi...
AAAI
2004
15 years 6 months ago
Spatial Aggregation for Qualitative Assessment of Scientific Computations
Qualitative assessment of scientific computations is an emerging application area that applies a data-driven approach to characterize, at a high level, phenomena including conditi...
Chris Bailey-Kellogg, Naren Ramakrishnan
APPINF
2003
15 years 6 months ago
A Multithreaded Compiler Backend for High-level Array Programming
Whenever large homogeneous data structures need to be processed in a non-trivial way, e.g. in computational sciences, image processing, or system simulation, high-level array prog...
Clemens Grelck
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
15 years 5 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi