Sciweavers

575 search results - page 111 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Figure/Ground Assignment in Natural Images
Abstract. Figure/ground assignment is a key step in perceptual organization which assigns contours to one of the two abutting regions, providing information about occlusion and all...
Xiaofeng Ren, Charless Fowlkes, Jitendra Malik
CCR
2004
86views more  CCR 2004»
13 years 7 months ago
On the scaling of congestion in the internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
VLSISP
2002
112views more  VLSISP 2002»
13 years 7 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
PAMI
2012
11 years 10 months ago
Fast Joint Estimation of Silhouettes and Dense 3D Geometry from Multiple Images
—We propose a probabilistic formulation of joint silhouette extraction and 3D reconstruction given a series of calibrated 2D images. Instead of segmenting each image separately i...
Kalin Kolev, Thomas Brox, Daniel Cremers
SPAA
2004
ACM
14 years 27 days ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran