Sciweavers

5356 search results - page 275 / 1072
» Adventures in time and space
Sort
View
UC
2005
Springer
16 years 5 days ago
Lower Bounds on the Computational Power of an Optical Model of Computation
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
Damien Woods, J. Paul Gibson
IPPS
2003
IEEE
15 years 12 months ago
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
Carlos E. R. Alves, Edson Cáceres, Siang W....
ICCAD
1999
IEEE
72views Hardware» more  ICCAD 1999»
15 years 11 months ago
An integrated algorithm for combined placement and libraryless technology mapping
This paper presents a new solution for combining technology mapping with placement, coupling the two into one phase. The original aspects of our work are the use of libraryless ma...
Yanbin Jiang, Sachin S. Sapatnekar
EMNLP
2007
15 years 8 months ago
Compressing Trigram Language Models With Golomb Coding
Trigram language models are compressed using a Golomb coding method inspired by the original Unix spell program. Compression methods trade off space, time and accuracy (loss). The...
Kenneth Church, Ted Hart, Jianfeng Gao
FLAIRS
2001
15 years 8 months ago
The History of the Mobot Museum Robot Series: An Evolutionary Study
: This paper describes a long-terra project to install socially interactive, autonomousmobile robots in public spaces. We have deployed four robots over the last three years, accum...
Thomas Willeke, Clayton Kunz, Illah R. Nourbakhsh