Sciweavers

3823 search results - page 311 / 765
» Experiments with Random Projection
Sort
View
COMGEO
2004
ACM
15 years 4 months ago
Speeding up the incremental construction of the union of geometric objects in practice
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
Eti Ezra, Dan Halperin, Micha Sharir
DAC
2007
ACM
16 years 5 months ago
Synthesizing Stochasticity in Biochemical Systems
Randomness is inherent to biochemistry: at each instant, the sequence of reactions that fires is a matter of chance. Some biological systems exploit such randomness, choosing betw...
Brian Fett, Jehoshua Bruck, Marc D. Riedel
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 5 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
ISSTA
2010
ACM
15 years 6 months ago
OCAT: object capture-based automated testing
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...
Hojun Jaygarl, Sunghun Kim, Tao Xie, Carl K. Chang
COLT
2008
Springer
15 years 6 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim