Sciweavers

1322 search results - page 49 / 265
» Parameterized counting problems
Sort
View
PTS
2007
97views Hardware» more  PTS 2007»
13 years 10 months ago
Learning and Integration of Parameterized Components Through Testing
Abstract. We investigate the use of parameterized state machine models to drive integration testing, in the case where the models of components are not available beforehand. Theref...
Muzammil Shahbaz, Keqin Li 0002, Roland Groz
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 9 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
ICMCS
2006
IEEE
99views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Counting of Video Clip Repetitions using a Modified BMH Algorithm: Preliminary Results
In this work, we cope with the problem of identifying the number of repetitions of a specific video clip in a target video clip. Generally, the methods that deal with this proble...
Silvio Jamil Ferzoli Guimarães, Renata Rodr...
LATIN
2004
Springer
14 years 2 months ago
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...
Graham Cormode, S. Muthukrishnan
DAC
1996
ACM
14 years 28 days ago
A Hardware/Software Partitioning Algorithm for Designing Pipelined ASIPs with Least Gate Counts
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
Nguyen-Ngoc Bình, Masaharu Imai, Akichika S...