Sciweavers

5128 search results - page 618 / 1026
» Discrete Component Analysis
Sort
View
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 8 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
SERP
2007
15 years 8 months ago
From Functional Requirements through Test Evaluation Design to Automatic Test Data Patterns Retrieval - a Concept for Testing of
- Functional testing of software dedicated for hybrid embedded systems should start at the early development phase and requires analysis of discrete and continuous signals, where t...
Justyna Zander-Nowicka, Abel Marrero Pérez,...
ERSA
2006
147views Hardware» more  ERSA 2006»
15 years 8 months ago
Code Partitioning for Reconfigurable High-Performance Computing: A Case Study
In this case study, various ways to partition a code between the microprocessor and FPGA are examined. Discrete image convolution operation with separable kernel is used as the ca...
Volodymyr V. Kindratenko
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 8 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
WSC
2004
15 years 8 months ago
A Framework for Adaptive Synchronization of Distributed Simulations
Increased complexity of simulation models and the related modeling needs for global supply chains have necessitated the execution of simulations on multiple processors. While dist...
Bertan Altuntas, Richard A. Wysk