Sciweavers

273 search results - page 12 / 55
» Mechanization for solving SPP by reducing order method
Sort
View
PRDC
2007
IEEE
14 years 2 months ago
An Automatic Real-Time Analysis of the Time to Reach Consensus
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
Tatsuhiro Tsuchiya, André Schiper
JETAI
2008
93views more  JETAI 2008»
13 years 8 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
APCHI
2004
IEEE
13 years 11 months ago
inlineLink: Realization of Inline Expansion Link Methods on a Conventional Web Browser
Conventional web browsing displays a web page inside of a window. In conventional web browsing, following a link replaces the previous document entirely, and the readers tend to lo...
Motoki Miura, Buntarou Shizuki, Jiro Tanaka
ICMCS
2009
IEEE
180views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Foreground segmentation for static video via multi-core and multi-modal graph cut
We proposed a new foreground detection method using the static cameras. It merges multi-modality into graph cut energy function, and performs much better results than conventional...
Lun-Yu Chang, Winston H. Hsu
CVPR
2007
IEEE
14 years 2 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...