Sciweavers

110 search results - page 2 / 22
» Searching with lies under error cost constraints
Sort
View
EUROMICRO
2000
IEEE
13 years 10 months ago
Task Assignment and Scheduling under Memory Constraints
Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constrain...
Radoslaw Szymanek, Krzysztof Kuchcinski
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
13 years 7 months ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner
IUI
2012
ACM
12 years 1 months ago
Mobile texting: can post-ASR correction solve the issues? an experimental study on gain vs. costs
The next big step in embedded, mobile speech recognition will be to allow completely free input as it is needed for messaging like SMS or email. However, unconstrained dictation r...
Michael Feld, Saeedeh Momtazi, Farina Freigang, Di...
SPAA
2003
ACM
13 years 11 months ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...
IPMI
2005
Springer
14 years 7 months ago
Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
Kang Li, Steven Millington, Xiaodong Wu, Danny Z. ...