Sciweavers

1068 search results - page 125 / 214
» On Space Bounded Server Algorithms
Sort
View
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 10 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
ICCV
1998
IEEE
14 years 9 months ago
A Metric for Distributions with Applications to Image Databases
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
Yossi Rubner, Carlo Tomasi, Leonidas J. Guibas
DCG
2008
104views more  DCG 2008»
13 years 8 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger
SI3D
2009
ACM
14 years 2 months ago
A novel page-based data structure for interactive walkthroughs
Given a data layout of a large walkthrough scene, we present a novel and simple spatial hierarchy on the disk-pages of the layout that has notable advantages over a conventional s...
Behzad Sajadi, Yan Huang, Pablo Diaz-Gutierrez, Su...
ICST
2009
IEEE
14 years 2 months ago
Optimizing Generation of Object Graphs in Java PathFinder
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...
Milos Gligoric, Tihomir Gvero, Steven Lauterburg, ...