Sciweavers

5473 search results - page 802 / 1095
» On the graph isomorphism problem
Sort
View
JUCS
2006
92views more  JUCS 2006»
15 years 6 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa
PE
2008
Springer
108views Optimization» more  PE 2008»
15 years 6 months ago
Rate-optimal schemes for Peer-to-Peer live streaming
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
Laurent Massoulié, Andrew Twigg
PRL
2006
117views more  PRL 2006»
15 years 6 months ago
Improving image segmentation quality through effective region merging using a hierarchical social metaheuristic
This paper proposes a new evolutionary region merging method in order to efficiently improve segmentation quality results. Our approach starts from an oversegmented image, which is...
Abraham Duarte, Miguel Ángel Sánchez...
IM
2007
15 years 6 months ago
Real Number Labelings for Paths and Cycles
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...
Jerrold R. Griggs, Xiaohua Teresa Jin
TIT
2008
103views more  TIT 2008»
15 years 6 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah