Sciweavers

141 search results - page 13 / 29
» Partitioning Approach to Visualization of Large Graphs
Sort
View
SAMT
2009
Springer
180views Multimedia» more  SAMT 2009»
14 years 2 months ago
RelFinder: Revealing Relationships in RDF Knowledge Bases
Abstract. The Semantic Web has recently seen a rise of large knowledge bases (such as DBpedia) that are freely accessible via SPARQL endpoints. The structured representation of the...
Philipp Heim, Sebastian Hellmann, Jens Lehmann, St...
ICN
2009
Springer
14 years 3 days ago
An Approach to Data Extraction and Visualisation for Wireless Sensor Networks
—Ever since Descartes introduced planar coordinate systems, visual representations of data have become a widely accepted way of describing scientific phenomena. Modern advances ...
Mohammad Hammoudeh, Robert M. Newman, Sarah Mount
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 8 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ISPAN
1997
IEEE
13 years 11 months ago
A Parallel Pipelined Renderer for Time-Varying Volume Data
This paper presents a strategy for efficiently rendering time-varying volume data on a distributed-memory parallel computer. Visualizing time-varying volume data take both large s...
Tzi-cker Chiueh, Kwan-Liu Ma
DATE
2003
IEEE
102views Hardware» more  DATE 2003»
14 years 24 days ago
Power Constrained High-Level Synthesis of Battery Powered Digital Systems
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
S. F. Nielsen, Jan Madsen