1729 search results - page 178 / 346 » On Bounds for the k-Partitioning of Graphs |
316
click to vote
PVLDB
2011
15 years 1 months ago
2011
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
157
click to vote
TCOM
2011
15 years 1 months ago
2011
—To lower costs, WDM PONs may share the usage of wavelengths, transmitters, and receivers among ONUs, instead of dedicating the transmission between OLT and each ONU with one ind...
180
click to vote
SIAMCO
2010
15 years 1 months ago
2010
Tracking of reference signals (assumed bounded with essentially bounded derivative) is considered for a class of single-input, single-output, nonlinear systems, described by a func...
157
click to vote
TCS
2010
15 years 1 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
210
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...