Sciweavers

473 search results - page 71 / 95
» Computing shortest paths with uncertainty
Sort
View
CPAIOR
2007
Springer
15 years 3 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
DAS
2010
Springer
15 years 29 days ago
Handwritten Arabic text line segmentation using affinity propagation
In this paper, we present a novel graph-based method for extracting handwritten text lines in monochromatic Arabic document images. Our approach consists of two steps Coarse text ...
Jayant Kumar, Wael Abd-Almageed, Le Kang, David S....
ICASSP
2011
IEEE
14 years 1 months ago
Compression using self-similarity-based temporal super-resolution for full-exposure-time video
In order to allow sufficient amount of light into the image sensor, videos captured in poor lighting conditions typically have low frame rate and frame exposure time equals to in...
Mihoko Shimano, Gene Cheung, Imari Sato
EDBT
2012
ACM
255views Database» more  EDBT 2012»
13 years 1 days ago
Top-k spatial keyword queries on road networks
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
João B. Rocha-Junior, Kjetil Nørv&ar...