Sciweavers

4201 search results - page 377 / 841
» Interaction graphs: Additives
Sort
View
CONCUR
2003
Springer
16 years 1 days ago
Priority Rewrite Systems for OSOS Process Languages
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
Irek Ulidowski
PAKDD
2010
ACM
222views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Online Sampling of High Centrality Individuals in Social Networks
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
Arun S. Maiya, Tanya Y. Berger-Wolf
CVPR
2010
IEEE
15 years 11 months ago
"Lattice Cut" - Constructing superpixels using layer constraints
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
Alastair Moore, Simon Prince
183
Voted
FOCS
2000
IEEE
15 years 11 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
VLSID
2000
IEEE
75views VLSI» more  VLSID 2000»
15 years 11 months ago
Timing Analysis with Implicitly Specified False Paths
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
Eugene Goldberg, Alexander Saldanha