Sciweavers

2576 search results - page 406 / 516
» The Complexity of Zero Knowledge
Sort
View
TCS
2008
15 years 4 months ago
Bincoloring
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
ISCI
2007
138views more  ISCI 2007»
15 years 4 months ago
A fast algorithm for one-unit ICA-R
Independent component analysis (ICA) aims to recover a set of unknown mutually independent source signals from their observed mixtures without knowledge of the mixing coefficients...
Qiu-Hua Lin, Yong-Rui Zheng, Fuliang Yin, Hualou L...
TCSV
2008
150views more  TCSV 2008»
15 years 4 months ago
Mining Recurring Events Through Forest Growing
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
Junsong Yuan, Jingjing Meng, Ying Wu, Jiebo Luo
165
Voted
TIP
2008
119views more  TIP 2008»
15 years 4 months ago
A Multistage Motion Vector Processing Method for Motion-Compensated Frame Interpolation
In this paper, a novel, low-complexity motion vector processing algorithm at the decoder is proposed for motion-compensated frame interpolation or frame rate up-conversion. We addr...
Ai-Mei Huang, T. Q. Nguyen
159
Voted
JAIR
2007
146views more  JAIR 2007»
15 years 4 months ago
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match c...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....