Sciweavers

1604 search results - page 237 / 321
» Regularization on Discrete Spaces
Sort
View
SIAMCOMP
1998
102views more  SIAMCOMP 1998»
13 years 9 months ago
L-Printable Sets
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...
GIS
2006
ACM
14 years 11 months ago
ST-ACTS: a spatio-temporal activity simulator
Creating complex spatio?temporal simulation models is a hot issue in the area of spatio?temporal databases [7]. While existing Moving Object Simulators (MOSs) address different ph...
Gyözö Gidófalvi, Torben Bach Pede...
ISVLSI
2005
IEEE
169views VLSI» more  ISVLSI 2005»
14 years 3 months ago
High Performance Array Processor for Video Decoding
high NRE cost. Therefore, general purpose programmable processors using software to perform various functions become more attractive since programmability can simplify system devel...
J. Lee, Narayanan Vijaykrishnan, Mary Jane Irwin
IMR
2005
Springer
14 years 3 months ago
A fews snags in mesh adaptation loops
The first stage in an adaptive finite element scheme (cf. [CAS95, bor1]) consists in creating an initial mesh of a given domain Ω, which is used to perform an initial computati...
Frédéric Hecht
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
14 years 3 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader