Sciweavers

1578 search results - page 255 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 5 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 10 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
TIP
2002
105views more  TIP 2002»
13 years 9 months ago
Tree-structured method for LUT inverse halftoning and for image halftoning
1 Recently the authors proposed a Look Up Table (LUT) based method for inverse halftoning of images. The LUT for inverse halftoning is obtained from the histogram gathered from a f...
Murat Mese, Palghat P. Vaidyanathan
MOBICOM
2012
ACM
12 years 12 days ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
ICIP
2000
IEEE
14 years 11 months ago
Look up Table (LUT) Method for Image Halftoning
Recently we have applied Look Up Table (LUT) Method for inverse halftoning. We also proposed tree-structure LUT inverse halftoning in order to reduce memory requirements of the LU...
Murat Mese, Palghat P. Vaidyanathan