4744 search results - page 216 / 949 » Connected Computing |
145
click to vote
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
126
Voted
ICCS
2004
Springer
15 years 9 months ago
2004
Springer
Distributed computing in wide area networks requires special approach to solve the problem of communication between secure areas. Since there is no possibility to establish connect...
174
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
115
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
106
click to vote
CIE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset. The connection with the notions of fuzzy Turing machi...