Sciweavers

296 search results - page 31 / 60
» Group connectivity of certain graphs
Sort
View
SERP
2007
13 years 9 months ago
Developing an Online Function Reader
A function reader is a program that can read an input function and evaluate the function for a given input value at run time. Any Computer Algebra System and Graphing Calculator ar...
Mingshen Wu, Weihu Hong
ISSS
1998
IEEE
103views Hardware» more  ISSS 1998»
13 years 11 months ago
False Path Analysis Based on a Hierarchical Control Representation
False path analysis is an activity with applications in a variety of computer science and engineering domains like for instance high-level synthesis, worst case execution time est...
Apostolos A. Kountouris, Christophe Wolinski
GLOBECOM
2006
IEEE
14 years 1 months ago
Content Delivery in Overlay Networks: a Stochastic Graph Processes Perspective
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
MICCAI
2000
Springer
13 years 11 months ago
Interactive Organ Segmentation Using Graph Cuts
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
Yuri Boykov, Marie-Pierre Jolly
ICML
2005
IEEE
14 years 8 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...