Sciweavers

199 search results - page 24 / 40
» A Method for Selecting the Bin Size of a Time Histogram
Sort
View
ICIP
2009
IEEE
13 years 5 months ago
Optimization on active learning strategy for object category retrieval
Active learning is a framework that has attracted a lot of research interest in the content-based image retrieval (CBIR) in recent years. To be effective, an active learning syste...
David Gorisse, Matthieu Cord, Frédér...
IV
2002
IEEE
135views Visualization» more  IV 2002»
14 years 19 days ago
Static Visualization of Dynamic Data Flow Visual Program Execution
We propose ‘Trace View’, a static visualization method for monitoringand debugging the dynamic behavior of programs written in data flow visual programming languages. Trace V...
Buntarou Shizuki, Etsuya Shibayama, Masashi Toyoda
ATS
2002
IEEE
108views Hardware» more  ATS 2002»
14 years 21 days ago
Fault Set Partition for Efficient Width Compression
In this paper, we present a technique for reducing the test length of counter-based pseudo-exhaustive built-in self-testing (BIST) based on width compression method. More formally...
Emil Gizdarski, Hideo Fujiwara
GLOBECOM
2008
IEEE
13 years 8 months ago
Windowing BitTorrent for Video-on-Demand: Not All is Lost with Tit-for-Tat
—In this paper we present findings from our windowing BitTorrent simulations and show that by carefully optimizing other factors a reasonable level of performance can be achieved...
Petri Savolainen, Niklas Raatikainen, Sasu Tarkoma
PRL
2006
96views more  PRL 2006»
13 years 7 months ago
Fast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh