3571 search results - page 174 / 715 » Cohen and Set Theory |
177
click to vote
PODS
2005
ACM
16 years 3 days ago
2005
ACM
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
148
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
204
click to vote
ISSRE
2003
IEEE
15 years 11 months ago
2003
IEEE
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
209
click to vote
SIGIR
2003
ACM
15 years 11 months ago
2003
ACM
We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics ...
184
click to vote
ECCV
2000
Springer
15 years 11 months ago
2000
Springer
This paper presents a new method to find minimal paths in 3D images, giving as initial data one or two endpoints. This is based on previous work [1] for extracting paths in 2D ima...