Sciweavers

3602 search results - page 122 / 721
» Isn't It About Time
Sort
View
CONNECTION
2006
101views more  CONNECTION 2006»
13 years 10 months ago
Learning acceptable windows of contingency
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...
Kevin Gold, Brian Scassellati
JOT
2010
167views more  JOT 2010»
13 years 8 months ago
The Discrete Fourier Transform, Part 5: Spectrogram
This paper is part 5 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on the spectrog...
Douglas Lyon
JOT
2010
186views more  JOT 2010»
13 years 8 months ago
The Discrete Fourier Transform, Part 6: Cross-Correlation
This paper is part 6 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on correlation....
Douglas Lyon
ICMCS
2009
IEEE
180views Multimedia» more  ICMCS 2009»
13 years 8 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
IWOCA
2010
Springer
223views Algorithms» more  IWOCA 2010»
13 years 5 months ago
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
Konrad Dabrowski, Vadim V. Lozin, Haiko Mülle...