Sciweavers

436 search results - page 54 / 88
» Recursion and Complexity
Sort
View
GLOBECOM
2009
IEEE
14 years 8 days ago
Iterative Versus Adaptive Equalizers in Time-Variant Channels
—This paper discusses the application of iterative versus adaptive equalizers to a Universal Mobile Telecommunications System (UMTS) High Speed Downlink Packet Access (HSDPA) rec...
Clemens Buchacher, Joachim Wehinger, Mario Huemer
VMV
2008
197views Visualization» more  VMV 2008»
13 years 10 months ago
1-2-tree: Semantic Modeling and Editing of Trees
In computer graphics, procedural methods and Lsystems are common approaches to model complex botanical trees. In contrast to previous tree modeling systems, we propose linking rul...
Björn Ganster, Reinhard Klein
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
13 years 9 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...
IGPL
2006
107views more  IGPL 2006»
13 years 9 months ago
Undecidability over Continuous Time
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
Jerzy Mycka, José Félix Costa
CORR
2007
Springer
47views Education» more  CORR 2007»
13 years 9 months ago
Resource control of object-oriented programs
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
Jean-Yves Marion, Romain Péchoux