Sciweavers

15375 search results - page 3034 / 3075
» cans 2008
Sort
View
COCOA
2008
Springer
13 years 11 months ago
Simplicial Powers of Graphs
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...
Andreas Brandstädt, Van Bang Le
COCOON
2008
Springer
13 years 11 months ago
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constrai
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...
Hung Q. Ngo, Yang Wang 0014, Anh Le
COLT
2008
Springer
13 years 11 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
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...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
COLT
2008
Springer
13 years 11 months ago
An Information Theoretic Framework for Multi-view Learning
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...
Karthik Sridharan, Sham M. Kakade
COMPGEOM
2008
ACM
13 years 11 months ago
Untangling triangulations through local explorations
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 ...
Pankaj K. Agarwal, Bardia Sadri, Hai Yu
« Prev « First page 3034 / 3075 Last » Next »