4865 search results - page 284 / 973 » The Complexity of Graph Connectivity |
200
Voted
IJCAI
2003
15 years 8 months ago
2003
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
186
click to vote
JCT
2007
15 years 6 months ago
2007
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...
159
click to vote
SIAMDM
2000
15 years 6 months ago
2000
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
152
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
154
click to vote
IPPS
2006
IEEE
16 years 20 days ago
2006
IEEE
The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal st...