Sciweavers

3819 search results - page 418 / 764
» Simple Easy Terms
Sort
View
CVIU
2007
125views more  CVIU 2007»
15 years 6 months ago
Graph regularization for color image processing
Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation prob...
Olivier Lezoray, Abderrahim Elmoataz, Sébas...
ML
2008
ACM
135views Machine Learning» more  ML 2008»
15 years 6 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
TALG
2008
67views more  TALG 2008»
15 years 6 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
PE
1998
Springer
158views Optimization» more  PE 1998»
15 years 6 months ago
Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
Charles Knessl, Charles Tier
FOCM
2010
140views more  FOCM 2010»
15 years 5 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen