Sciweavers

1568 search results - page 154 / 314
» The problem of examination questions in algorithmics
Sort
View
SOFSEM
2000
Springer
15 years 8 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
STACS
2012
Springer
14 years 8 days ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 5 months ago
An Ad Omnia Approach to Defining and Achieving Private Data Analysis
We briefly survey several privacy compromises in published datasets, some historical and some on paper. An inspection of these suggests that the problem lies with the nature of the...
Cynthia Dwork
127
Voted
CVPR
2004
IEEE
16 years 6 months ago
Stereo Correspondence with Slanted Surfaces: Critical Implications of Horizontal Slant
We examine the stereo correspondence problem in the presence of slanted scene surfaces. In particular, we highlight a previously overlooked geometric fact: a horizontally slanted ...
Abhijit S. Ogale, Yiannis Aloimonos
COMPGEOM
2004
ACM
15 years 10 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel