837 search results - page 41 / 168 » Hard combinators |
FSTTCS
1992
Springer
15 years 3 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
104
click to vote
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— Humans rely on information-laden high-frequency accelerations in addition to quasi-static forces when interacting with objects via a handheld tool. Telerobotic systems have tra...
MICCAI
2010
Springer
14 years 10 months ago
2010
Springer
Automatic segmentation of the esophagus from CT data is a challenging problem. Its wall consists of muscle tissue, which has low contrast in CT. Sometimes it is filled with air or...
WWW
2007
ACM
16 years 15 days ago
2007
ACM
It is extremely hard for a global organization with services over multiple channels to capture a consistent and unified view of its data, services, and interactions. While SOA and...
105
click to vote
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
Object detection in clutter or occlusion is a hard problem in computer vision. We propose an object detection method based on contour grouping. Two stages are included: a novel di...