Sciweavers

147 search results - page 15 / 30
» The Computational Complexity of Quantified Reciprocals
Sort
View
APAL
2005
119views more  APAL 2005»
14 years 9 months ago
Elementary arithmetic
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...
Geoffrey E. Ostrin, Stanley S. Wainer
ICPP
2007
IEEE
15 years 3 months ago
Architectural Challenges in Memory-Intensive, Real-Time Image Forming
The real-time image forming in future, high-end synthetic aperture radar systems is an example of an application that puts new demands on computer architectures. The initial quest...
Anders Ahlander, H. Hellsten, K. Lind, J. Lindgren...
ICC
2007
IEEE
118views Communications» more  ICC 2007»
15 years 4 months ago
Critical Design Decisions for Cognitive Networks
— The idea of the cognitive network, drawn from previous research in cognitive radios and cross-layer design, is an attempt to address issues of complexity and scalability by all...
Ryan W. Thomas, Luiz A. DaSilva, Madhav V. Marathe...
HAPTICS
2005
IEEE
15 years 3 months ago
Tilt to Scroll: Evaluating a Motion Based Vibrotactile Mobile Interface
The increasing complexity and pervasiveness of handheld devices is demanding the development of interaction techniques explicitly tailored for mobile scenarios. This paper examine...
Ian Oakley, M. Sile O'Modhrain
NIPS
2001
14 years 11 months ago
Grammatical Bigrams
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
Mark A. Paskin