Sciweavers

1347 search results - page 2 / 270
» On the Structure of the Minimum Time Function
Sort
View
ASPDAC
2004
ACM
76views Hardware» more  ASPDAC 2004»
14 years 10 days ago
A fast method to derive minimum SOPs for decomposable functions
- This paper shows that divide-and-conquer derives a minimum sum-of-products expression (MSOP) of functions that have an AND bi-decomposition when at least one of the subfunctions ...
Tsutomu Sasao, Jon T. Butler
IVC
2008
83views more  IVC 2008»
13 years 6 months ago
A minimum description length objective function for groupwise non-rigid image registration
Groupwise non-rigid registration aims to find a dense correspondence across a set of images, so that analogous structures in the images are aligned. For purely automatic inter-sub...
Stephen Marsland, Carole J. Twining, Christopher J...
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
14 years 4 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah
JOTA
2010
104views more  JOTA 2010»
13 years 1 months ago
Structure and Weak Sharp Minimum of the Pareto Solution Set for Piecewise Linear Multiobjective Optimization
Abstract. In this paper the Pareto solution set of a piecewise linear multiobjective optimization problem in a normed space is shown to be a union of finitely many semiclosed polyh...
X. Q. Yang, N. D. Yen
ICPR
2006
IEEE
14 years 8 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu