Sciweavers

463 search results - page 77 / 93
» A General Framework for Graph Sparsification
Sort
View
CRV
2008
IEEE
165views Robotics» more  CRV 2008»
15 years 6 months ago
Hierarchical Stereo with Thin Structures and Transparency
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
Mikhail Sizintsev
FPGA
2007
ACM
119views FPGA» more  FPGA 2007»
15 years 5 months ago
Synthesis of an application-specific soft multiprocessor system
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high ...
Jason Cong, Guoling Han, Wei Jiang
BROADNETS
2006
IEEE
15 years 5 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
IPPS
2006
IEEE
15 years 5 months ago
Relationships between communication models in networks using atomic registers
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In ...
Lisa Higham, Colette Johnen
SIGIR
2006
ACM
15 years 5 months ago
Answering complex questions with random walk models
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
Sanda M. Harabagiu, V. Finley Lacatusu, Andrew Hic...