Sciweavers

9209 search results - page 70 / 1842
» Data Space Randomization
Sort
View
115
Voted
MOBIQUITOUS
2007
IEEE
15 years 8 months ago
Assessing Standard and Inverted Skip Graphs Using Multi-Dimensional Range Queries and Mobile Nodes
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
Gregory J. Brault, Christopher J. Augeri, Barry E....
SIGSOFT
1998
ACM
15 years 6 months ago
Further Empirical Studies of Test Effectiveness
This paper reports on an empirical evaluation of the fault-detecting ability of two white-box software testing techniques: decision coverage (branch testing) and the all-uses data...
Phyllis G. Frankl, Oleg Iakounenko
ICASSP
2010
IEEE
15 years 2 months ago
Evaluation of random-projection-based feature combination on speech recognition
Random projection has been suggested as a means of dimensionality reduction, where the original data are projected onto a subspace using a random matrix. It represents a computati...
Tetsuya Takiguchi, Jeff Bilmes, Mariko Yoshii, Yas...
107
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
Shooting permanent rays among disjoint polygons in the plane
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
Mashhood Ishaque, Bettina Speckmann, Csaba D. T&oa...
ICMLA
2007
15 years 3 months ago
Maximum Likelihood Quantization of Genomic Features Using Dynamic Programming
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...
Mingzhou (Joe) Song, Robert M. Haralick, Sté...