Sciweavers

2200 search results - page 237 / 440
» Bloch's Constant is Computable
Sort
View
COCO
2003
Springer
145views Algorithms» more  COCO 2003»
15 years 11 months ago
Hardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
Emanuele Viola
FSTTCS
2003
Springer
15 years 11 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
ECCV
2010
Springer
15 years 11 months ago
TriangleFlow: Optical Flow with Triangulation-based Higher-Order Likelihoods
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...
CCGRID
2002
IEEE
15 years 11 months ago
NEVRLATE: Scalable Resource Discovery
A scalable and expressive peer-to-peer (P2P) networking and computing framework requires efficient resource discovery services. Here we propose NEVRLATE, for Network-Efficient V...
Ajay Chander, Steven Dawson, Patrick Lincoln, Davi...
FCCM
2002
IEEE
133views VLSI» more  FCCM 2002»
15 years 11 months ago
Reconfigurable Shape-Adaptive Template Matching Architectures
This paper presents three reconfigurable computing approaches for a Shape-Adaptive Template Matching (SA-TM) method to retrieve arbitrarily shaped objects within images or video f...
Jörn Gause, Peter Y. K. Cheung, Wayne Luk