Sciweavers

144 search results - page 5 / 29
» Running time and program size for self-assembled squares
Sort
View
ICIP
2002
IEEE
14 years 9 months ago
Full search content independent block matching based on the fast Fourier transform
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
Mark S. Drew, Steven L. Kilthau, Torsten Möll...
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 5 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
FCCM
2008
IEEE
112views VLSI» more  FCCM 2008»
14 years 1 months ago
Power-Aware and Branch-Aware Word-Length Optimization
Power reduction is becoming more important as circuit size increases. This paper presents a tool called PowerCutter which employs accuracy-guaranteed word-length optimization to r...
William G. Osborne, José Gabriel F. Coutinh...
ASP
2001
Springer
13 years 12 months ago
Useful Transformations in Answer set programming
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
Mauricio Osorio, Juan Carlos Nieves, Chris Giannel...
JUCS
2010
142views more  JUCS 2010»
13 years 5 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima