Sciweavers

2745 search results - page 428 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
DASFAA
2006
IEEE
92views Database» more  DASFAA 2006»
15 years 8 months ago
Document Decomposition for XML Compression: A Heuristic Approach
Sharing of common subtrees has been reported useful not only for XML compression but also for main-memory XML query processing. This method compresses subtrees only when they exhib...
Byron Choi
FPL
2006
Springer
96views Hardware» more  FPL 2006»
15 years 8 months ago
High Speed Document Clustering in Reconfigurable Hardware
High-performance document clustering systems enable similar documents to automatically self-organize into groups. In the past, the large amount of computational time needed to clu...
G. Adam Covington, Charles L. G. Comstock, Andrew ...
CEC
2010
IEEE
15 years 5 months ago
Evolving cascades of voting feature detectors for vehicle detection in satellite imagery
We propose an evolutionary method for detection of vehicles in satellite imagery which involves a large number of simple elementary features and multiple detectors trained by genet...
Krzysztof Krawiec, Bartosz Kukawka, Tomasz Macieje...
JUCS
2007
108views more  JUCS 2007»
15 years 4 months ago
On Pipelining Sequences of Data-Dependent Loops
: Sequences of data-dependent tasks, each one traversing large data sets, exist in many applications (such as video, image and signal processing applications). Those tasks usually ...
Rui Rodrigues, João M. P. Cardoso
PASTE
2010
ACM
15 years 3 months ago
Property-aware program sampling
Monitoring or profiling programs provides us with an understanding for its further improvement and analysis. Typically, for monitoring or profiling, the program is instrumented ...
Harish Narayanappa, Mukul S. Bansal, Hridesh Rajan