Sciweavers

3008 search results - page 489 / 602
» Independence in connected graphs
Sort
View
ICDAR
2011
IEEE
14 years 6 months ago
Character Enhancement for Historical Newspapers Printed Using Hot Metal Typesetting
—We propose a new method for an effective removal of the printing artifacts occurring in historical newspapers which are caused by problems in the hot metal typesetting, a widely...
Iuliu Vasile Konya, Stefan Eickeler, Christoph Sei...
253
Voted
MOBIHOC
2012
ACM
13 years 9 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 7 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
PODC
2004
ACM
16 years 11 days ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
ICIP
2007
IEEE
16 years 8 months ago
Multiple Description Video Transcoding
In this paper we introduce the concept of multiple description video transcoding (MDVT). MDVT converts a single description encoded video into two or more descriptions at an interm...
Ali El Essaili, Shoaib Khan, Wolfgang Kellerer, Ec...