Sciweavers

3757 search results - page 599 / 752
» The overlap number of a graph
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
ShadowCuts: Photometric Stereo with Shadows
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...
Manmohan Krishna Chandraker, Sameer Agarwal, David...
ICPR
2004
IEEE
16 years 7 months ago
Landscape of Clustering Algorithms
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
Anil K. Jain, Alexander P. Topchy, Martin H. C. La...
PPOPP
2009
ACM
16 years 7 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
16 years 6 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin
VLSID
2004
IEEE
292views VLSI» more  VLSID 2004»
16 years 6 months ago
NoCGEN: A Template Based Reuse Methodology for Networks on Chip Architecture
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...
Jeremy Chan, Sri Parameswaran