Sciweavers

330 search results - page 62 / 66
» Algorithms for Propositional Model Counting
Sort
View
KCAP
2011
ACM
14 years 8 days ago
Eliciting hierarchical structures from enumerative structures for ontology learning
Some discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hi...
Mouna Kamel, Bernard Rothenburger
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
15 years 10 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
VISUALIZATION
2002
IEEE
15 years 2 months ago
Fast Visualization of Plane-Like Structures in Voxel Data
We present a robust, noise-resistant criterion characterizing planelike skeletons in binary voxel objects. It is based on a distance map and the geodesic distance along the object...
Steffen Prohaska, Hans-Christian Hege
VISUALIZATION
1997
IEEE
15 years 1 months ago
ROAMing terrain: real-time optimally adapting meshes
Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraf...
Mark A. Duchaineau, Murray Wolinsky, David E. Sige...
COMPGEOM
1992
ACM
15 years 1 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl