Sciweavers

1208 search results - page 30 / 242
» On Counting Generalized Colorings
Sort
View
TOG
2010
121views more  TOG 2010»
13 years 2 months ago
Data-driven image color theme enhancement
It is often important for designers and photographers to convey or enhance desired color themes in their work. A color theme is typically defined as a template of colors and an as...
Baoyuan Wang, Yizhou Yu, Tien-Tsin Wong, Chun Chen...
ICIP
2009
IEEE
14 years 8 months ago
Effective Initialization Of K-means For Color Quantization
Color quantization is an important operation with many applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms...
CORR
2007
Springer
162views Education» more  CORR 2007»
13 years 7 months ago
Order-Invariant MSO is Stronger than Counting MSO in the Finite
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
Tobias Ganzow, Sasha Rubin
SIGMETRICS
2008
ACM
13 years 7 months ago
DRAM is plenty fast for wirespeed statistics counting
Per-flow network measurement at Internet backbone links requires the efficient maintanence of large arrays of statistics counters at very high speeds (e.g. 40 Gb/s). The prevailin...
Bill Lin, Jun (Jim) Xu
INFOCOM
2012
IEEE
11 years 10 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy