Sciweavers

9209 search results - page 47 / 1842
» Data Space Randomization
Sort
View
ICAT
2007
IEEE
14 years 4 months ago
"Space Frames": Using space, color and animation in the visualization of complex graph systems
This study concerns the development of 3D interfaces that aid the navigation of large data structures through the usage of the HSV color space, and the ensuing “spatial framesâ€...
Elif E. Ayiter, Selim Balcisoy, Murat Germen, Isma...
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
14 years 1 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan
ILP
2004
Springer
14 years 3 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
ANSS
2004
IEEE
14 years 1 months ago
A Spatial Analysis of Mobility Models: Application to Wireless Ad Hoc Network Simulation
We quantatively analyze the differences between a realistic mobility model, TRANSIMS, and several synthetic mobility models. New synthetic models were created by modifying the sta...
D. Charles Engelhart, Anand Sivasubramaniam, Chris...
CCCG
2008
13 years 11 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...