Sciweavers

1883 search results - page 246 / 377
» Ordered theta graphs
Sort
View
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 9 months ago
CAT-generation of ideals
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
Torsten Ueckerdt
PRL
2006
117views more  PRL 2006»
13 years 9 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...
TIT
2008
103views more  TIT 2008»
13 years 9 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
CAI
2002
Springer
13 years 9 months ago
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
Ivan Stojmenovic, Mark Russell, Bosko Vukojevic
DM
2002
95views more  DM 2002»
13 years 9 months ago
On the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Camino Balbuena, Ignacio M. Pelayo, J. Góme...