15375 search results - page 3034 / 3075 » cans 2008 |
111
click to vote
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
114
click to vote
COCOON
2008
Springer
15 years 3 months ago
2008
Springer
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
144
click to vote
COLT
2008
Springer
15 years 3 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
117
click to vote
COLT
2008
Springer
15 years 3 months ago
2008
Springer
In the multi-view learning paradigm, the input variable is partitioned into two different views X1 and X2 and there is a target variable Y of interest. The underlying assumption i...
99
Voted
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
In many applications it is often desirable to maintain a valid mesh within a certain domain that deforms over time. During a period for which the underlying mesh topology remains ...