13603 search results - page 85 / 2721 » On the Computational Complexity of Cut-Reduction |
146
click to vote
CCA
2005
Springer
15 years 7 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
118
click to vote
BMVC
2000
15 years 7 months ago
2000
In this study we seek a fast method for robust, boundary preserving estimation of optical flow. Several studies have addressed this topic and proposed methods that account for vel...
168
click to vote
JCIT
2010
15 years 21 days ago
2010
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...
138
click to vote
TCS
2008
15 years 5 months ago
2008
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
140
click to vote
INTERACT
2007
15 years 7 months ago
2007
This paper investigates novel ways to direct computers by eye gaze. Instead of using fixations and dwell times, this work focuses on eye motion, in particular gaze gestures. Gaze g...