Sciweavers

157 search results - page 23 / 32
» SLIDE: A Useful Special Case of the CARDPATH Constraint
Sort
View
IJCAI
1997
13 years 10 months ago
Learning Topological Maps with Weak Local Odometric Information
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
Hagit Shatkay, Leslie Pack Kaelbling
CASES
2007
ACM
14 years 19 days ago
Fragment cache management for dynamic binary translators in embedded systems with scratchpad
Dynamic binary translation (DBT) has been used to achieve numerous goals (e.g., better performance) for general-purpose computers. Recently, DBT has also attracted attention for e...
José Baiocchi, Bruce R. Childers, Jack W. D...
JDA
2007
156views more  JDA 2007»
13 years 8 months ago
A linear time algorithm for the inversion median problem in circular bacterial genomes
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathri...
ICIP
2001
IEEE
14 years 10 months ago
Color error diffusion with generalized optimum noise shaping
Wc optimizc thc noisc shaping bchavior of color crror diffusion by designing an optirnizcd crror filtcr bascd on a proposed noisc shaping modcl for color crror diffusion and a gcn...
Niranjan Damera-Venkata, Brian L. Evans
CODES
2010
IEEE
13 years 6 months ago
Statistical approach in a system level methodology to deal with process variation
The impact of process variation in state of the art technology makes traditional (worst case) designs unnecessarily pessimistic, which translates to suboptimal designs in terms of...
Concepción Sanz Pineda, Manuel Prieto, Jos&...