Sciweavers

2492 search results - page 223 / 499
» On the General Signature Trees
Sort
View
CACM
1998
110views more  CACM 1998»
15 years 6 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 6 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
JMLR
2010
117views more  JMLR 2010»
15 years 1 months ago
Exploiting the High Predictive Power of Multi-class Subgroups
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
Tarek Abudawood, Peter A. Flach
DAC
2011
ACM
14 years 6 months ago
Fault-tolerant 3D clock network
Clock tree synthesis is one of the most important and challenging problems in 3D ICs. The clock signals have to be delivered by through-silicon vias (TSVs) to different tiers with...
Chiao-Ling Lung, Yu-Shih Su, Shih-Hsiu Huang, Yiyu...
GD
2004
Springer
16 years 3 hour ago
Visualizing Large Graphs with Compound-Fisheye Views and Treemaps
Compound-fisheye views are introduced as a method for the display and interaction with large graphs. The method relies on a hierarchical clustering of the graph, and a generalizat...
James Abello, Stephen G. Kobourov, Roman Yusufov