Sciweavers

4171 search results - page 403 / 835
» Choice numbers of graphs
Sort
View
161
Voted
DAC
1996
ACM
15 years 11 months ago
Using Register-Transfer Paths in Code Generation for Heterogeneous Memory-Register Architectures
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
Guido Araujo, Sharad Malik, Mike Tien-Chien Lee
DIM
2007
ACM
15 years 11 months ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
TREC
2008
15 years 8 months ago
Weighted PageRank: Cluster-Related Weights
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...
Danil Nemirovsky, Konstantin Avrachenkov
CGF
2010
155views more  CGF 2010»
15 years 7 months ago
SmallWorlds: Visualizing Social Recommendations
We present SmallWorlds, a visual interactive graph-based interface that allows users to specify, refine and build item-preference profiles in a variety of domains. The interface f...
Brynjar Gretarsson, John O'Donovan, Svetlin Bostan...
CVIU
2008
180views more  CVIU 2008»
15 years 7 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...