Sciweavers

2314 search results - page 373 / 463
» Minimal Partitions of a Graph
Sort
View
ICTAI
2009
IEEE
16 years 8 days ago
EBLearn: Open-Source Energy-Based Learning in C++
Energy-based learning (EBL) is a general framework to describe supervised and unsupervised training methods for probabilistic and non-probabilistic factor graphs. An energy-based ...
Pierre Sermanet, Koray Kavukcuoglu, Yann LeCun
BROADNETS
2006
IEEE
15 years 11 months ago
Complexity of Converter Placement Supporting Broadcast in WDM Networks
Abstract— Wavelength converters simplify the wavelength assignment problem in virtual topology design in optical networks and increase the utilization of the fiber bandwidth. Ho...
Rudra Dutta, Prashant Iyer, Carla D. Savage
ICPR
2010
IEEE
15 years 11 months ago
Geodesic Thin Plate Splines for Image Segmentation
Thin Plate Splines are often used in image registration to model deformations. Its physical analogy involves a thin lying sheet of metal that is deformed and forced to pass throug...
Herve Lombaert, Farida Cheriet
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
15 years 11 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
MICRO
1998
IEEE
91views Hardware» more  MICRO 1998»
15 years 10 months ago
Effective Cluster Assignment for Modulo Scheduling
Clustering is one solution to the demand for wideissue machines and fast clock cycles because it allows for smaller, less ported register files and simpler bypass logic while rema...
Erik Nystrom, Alexandre E. Eichenberger