Sciweavers

6142 search results - page 498 / 1229
» The Complexity of Partition Functions
Sort
View
SIAMDM
2008
119views more  SIAMDM 2008»
15 years 6 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
IVC
2007
120views more  IVC 2007»
15 years 6 months ago
Modelling and segmentation of colour images in polar representations
The suitability of polar representation for quantitative image processing tasks is investigated. The classical colour polar-based representations (HLS, HSV, etc.) lead to brightne...
Jesús Angulo, Jean Serra
CN
1998
66views more  CN 1998»
15 years 6 months ago
Route Servers for Inter-Domain Routing
Internet transmission and switching facilities are partitioned into different administrative domains. To effect routing between domains, domain border routers establish pairwise p...
Ramesh Govindan, Cengiz Alaettinoglu, Kannan Varad...
TVLSI
1998
83views more  TVLSI 1998»
15 years 6 months ago
Low overhead fault-tolerant FPGA systems
— Fault-tolerance is an important system metric for many operating environments, from automotive to space exploration. The conventional technique for improving system reliability...
John Lach, William H. Mangione-Smith, Miodrag Potk...
PAMI
2007
202views more  PAMI 2007»
15 years 6 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis