3702 search results - page 267 / 741 » All Pairings Are in a Group |
174
click to vote
COMPGEOM
2006
ACM
16 years 21 days ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
162
click to vote
CTRS
1990
15 years 10 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
164
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The design of oligonucleotides and PCR primers for studying large genomes is complicated by the redundancy of sequences. The eukaryotic genomes are particularly diffic...
155
Voted
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
We present a new image segmentation algorithm based on graph cuts. Our main tool is separation of each pixel from a special point outside the image by a cut of a minimum cost. Suc...
245
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We present a method to automatically learn object categories from unlabeled images. Each image is represented by an unordered set of local features, and all sets are embedded into...