Sciweavers

108 search results - page 20 / 22
» Two-Level Push-Relabel Algorithm for the Maximum Flow Proble...
Sort
View
EJWCN
2010
119views more  EJWCN 2010»
13 years 2 months ago
Simulations of the Impact of Controlled Mobility for Routing Protocols
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
Valeria Loscrì, Enrico Natalizio, Carmelo C...
PAMI
2010
207views more  PAMI 2010»
13 years 2 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
WWW
2005
ACM
14 years 8 months ago
Partitioning of Web graphs by community topology
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura
SLIP
2009
ACM
14 years 2 months ago
Integrated interlayer via planning and pin assignment for 3D ICs
As technology advances, 3D ICs are introduced for alleviating the interconnect problem coming with shrinking feature size and increasing integration density. In 3D ICs, one of the...
Xu He, Sheqin Dong, Xianlong Hong, Satoshi Goto