Sciweavers

4451 search results - page 129 / 891
» On Random Ordering Constraints
Sort
View
238
Voted
ASPDAC
2008
ACM
94views Hardware» more  ASPDAC 2008»
15 years 6 months ago
Robust on-chip bus architecture synthesis for MPSoCs under random tasks arrival
A major trend in a modern system-on-chip design is a growing system complexity, which results in a sharp increase of communication traffic on the on-chip communication bus architec...
Sujan Pandey, Rolf Drechsler
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
16 years 4 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
KBSE
1997
IEEE
15 years 8 months ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...
ECCV
2008
Springer
16 years 6 months ago
A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus
The Random Sample Consensus (RANSAC) algorithm is a popular tool for robust estimation problems in computer vision, primarily due to its ability to tolerate a tremendous fraction o...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
KDD
2004
ACM
195views Data Mining» more  KDD 2004»
16 years 4 months ago
Improved robustness of signature-based near-replica detection via lexicon randomization
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
Aleksander Kolcz, Abdur Chowdhury, Joshua Alspecto...