Sciweavers

549 search results - page 35 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
ICS
2007
Tsinghua U.
15 years 3 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
81
Voted
EUROPAR
2009
Springer
15 years 1 months ago
Surfing Peer-to-Peer IPTV: Distributed Channel Switching
It is now common for IPTV systems attracting millions of users to be based on a peer-to-peer (P2P) architecture. In such systems, each channel is typically associated with one P2P ...
Anne-Marie Kermarrec, Erwan Le Merrer, Yaning Liu,...
SIBGRAPI
2005
IEEE
15 years 3 months ago
Linear Complexity Stereo Matching Based on Region Indexing
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
Marco Antonio Floriano de Oliveira, Raul Sidnei Wa...
85
Voted
FOCS
2003
IEEE
15 years 3 months ago
A Non-Markovian Coupling for Randomly Sampling Colorings
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
Thomas P. Hayes, Eric Vigoda
ECCV
2006
Springer
15 years 11 months ago
Level-Set Curve Particles
In many applications it is necessary to track a moving and deforming boundary on the plane from infrequent, sparse measurements. For instance, each of a set of mobile observers may...
Tingting Jiang, Carlo Tomasi