Sciweavers

147 search results - page 24 / 30
» Partitioning procedure for polynomial optimization
Sort
View
DAC
2007
ACM
14 years 9 months ago
Compact State Machines for High Performance Pattern Matching
Pattern matching is essential to a wide range of applications such as network intrusion detection, virus scanning, etc. Pattern matching algorithms normally rely on state machines...
Piti Piyachon, Yan Luo
ACCV
2006
Springer
14 years 2 months ago
Inducing Semantic Segmentation from an Example
Segmenting an image into semantically meaningful parts is a fundamental and challenging task in computer vision. Automatic methods are able to segment an image into coherent region...
Yaar Schnitman, Yaron Caspi, Daniel Cohen-Or, Dani...
ATMN
1996
13 years 10 months ago
Dynamic time sharing: a new approach for congestion management
A new approach for bandwidth allocation and congestion control is reported in this paper, which is of the Rate Controlled admission with Priority Scheduling service type. It is ca...
Adrian Popescu, Parag Pruthi
CVPR
2010
IEEE
13 years 8 months ago
Learning kernels for variants of normalized cuts: Convex relaxations and applications
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Chr...
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 2 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...