Sciweavers

5030 search results - page 158 / 1006
» cases 2007
Sort
View
165
Voted
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
16 years 1 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod
ACL
1989
15 years 8 months ago
Evaluating Discourse Processing Algorithms
In order to take steps towards establishing a methodology for evaluating Natural Language systems, we conducted a case study. We attempt to evaluate two different approaches to an...
Marilyn A. Walker
ICC
2007
IEEE
142views Communications» more  ICC 2007»
16 years 1 months ago
Generalized CRLB for DA and NDA Synchronization of UWB Signals with Clock Offset
—In this paper the Cramér-Rao lower bound (CRLB) of an ultra-wideband (UWB) pulse amplitude modulated (PAM) signal with time hopping (TH) code is derived for the practical case ...
Saeed Khalesehosseini, John Nielsen
INFOCOM
2007
IEEE
16 years 1 months ago
Discrete Power Control: Cooperative and Non-Cooperative Optimization
— We consider an uplink power control problem where each mobile wishes to maximize its throughput (which depends on the transmission powers of all mobiles) but has a constraint o...
Eitan Altman, Konstantin Avrachenkov, Gregory Mill...
ESA
2007
Springer
101views Algorithms» more  ESA 2007»
16 years 1 months ago
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
Haim Kaplan, Natan Rubin, Micha Sharir