619 search results - page 80 / 124 » Random Bichromatic Matchings |
CIVR
2003
Springer
14 years 2 months ago
2003
Springer
We are trying to integrate television cooking videos with corresponding cookbooks. The cookbook has the advantage of the capability to easily browse through a cooking procedure, bu...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
SIBGRAPI
1999
IEEE
14 years 1 months ago
1999
IEEE
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
IPPS
1993
IEEE
14 years 1 months ago
1993
IEEE
The dramatic improvements in the processing rates of parallel computers are turning many compute-bound jobs into IO-bound jobs. Parallel le systems have been proposed to better ma...