Sciweavers

401 search results - page 62 / 81
» Sparse Quasi-Random Graphs
Sort
View
ER
2004
Springer
90views Database» more  ER 2004»
14 years 1 months ago
WUML: A Web Usage Manipulation Language for Querying Web Log Data
In this paper, we develop a novel Web Usage Manipulation Language (WUML) which is a declarative language for manipulating Web log data. We assume that a set of trails formed by use...
Qingzhao Tan, Yiping Ke, Wilfred Ng
3DPVT
2002
IEEE
150views Visualization» more  3DPVT 2002»
14 years 21 days ago
Coding with ASCII: compact, yet text-based 3D content
Because of the convenience of a text-based format 3D content is often published in form of a gzipped file that contains an ASCII description of the scene graph. While compressed ...
Martin Isenburg, Jack Snoeyink
IPPS
1996
IEEE
13 years 12 months ago
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
Cong Fu, Tao Yang
ICASSP
2009
IEEE
13 years 11 months ago
Principal component analysis in decomposable Gaussian graphical models
We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. ...
Ami Wiesel, Alfred O. Hero III
DIAGRAMS
2006
Springer
13 years 11 months ago
Exploring the Effect of Animation and Progressive Revealing on Diagrammatic Problem Solving
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
Daesub Yoon, N. Hari Narayanan, SooCheol Lee, Oh-C...