Sciweavers

138 search results - page 19 / 28
» The Hypocoloring Problem: Complexity and Approximability Res...
Sort
View
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
14 years 8 months ago
Bloom Filter-based XML Packets Filtering for Millions of Path Queries
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou
ICIP
2010
IEEE
13 years 5 months ago
Earth Mover Distance on superpixels
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
Sylvain Boltz, Frank Nielsen, Stefano Soatto
PAA
2002
13 years 7 months ago
Combining Discriminant Models with New Multi-Class SVMs
: The idea of performing model combination, instead of model selection, has a long theoretical background in statistics. However, making use of theoretical results is ordinarily su...
Yann Guermeur
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 7 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
ICCAD
2002
IEEE
122views Hardware» more  ICCAD 2002»
14 years 4 months ago
Schedulability analysis of multiprocessor real-time applications with stochastic task execution times
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distrib...
Sorin Manolache, Petru Eles, Zebo Peng