Sciweavers

11565 search results - page 257 / 2313
» Computing Minimal Mappings
Sort
View
HCI
2009
15 years 3 months ago
Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D
Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the re...
Takao Ito, Kazuo Misue, Jiro Tanaka
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
14 years 8 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
RT
2004
Springer
15 years 11 months ago
Anti-aliasing and Continuity with Trapezoidal Shadow Maps
This paper proposes a new shadow map technique termed trapezoidal shadow maps to calculate high quality shadows in real-time applications. To address the resolution problem of the...
Tobias Martin, Tiow Seng Tan
SBCCI
2005
ACM
98views VLSI» more  SBCCI 2005»
15 years 11 months ago
Mapping embedded systems onto NoCs: the traffic effect on dynamic energy estimation
This work addresses the problem of application mapping in networks-on-chip (NoCs). It explores the importance of characterizing network traffic to effectively predict NoC energy c...
José Carlos S. Palma, César A. M. Ma...
CIKM
2010
Springer
15 years 4 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...