Sciweavers

2366 search results - page 39 / 474
» Mapping time
Sort
View
JMLR
2010
115views more  JMLR 2010»
13 years 3 months ago
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact ...
Nic Schraudolph
COMPGEOM
1998
ACM
14 years 27 days ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled
DAC
2006
ACM
14 years 9 months ago
Efficient SAT-based Boolean matching for FPGA technology mapping
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
Sean Safarpour, Andreas G. Veneris, Gregg Baeckler...
DSD
2003
IEEE
138views Hardware» more  DSD 2003»
14 years 1 months ago
A Two-step Genetic Algorithm for Mapping Task Graphs to a Network on Chip Architecture
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
Tang Lei, Shashi Kumar
WACV
2005
IEEE
14 years 4 months ago
Detecting Motion Patterns via Direction Maps with Application to Surveillance
To facilitate accurate and efficient detection of motion patterns in video data, it is desirable to abstract from pixel intensity values to representations that explicitly and co...
Jacob M. Gryn, Richard P. Wildes, John K. Tsotsos