Sciweavers

811 search results - page 59 / 163
» Avoiding Approximate Squares
Sort
View
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 9 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
AUSAI
2010
Springer
13 years 5 months ago
A Heuristic on Effective and Efficient Clustering on Uncertain Objects
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
Edward Hung, Lei Xu, Chi-Cheong Szeto
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
13 years 2 months ago
Optimal cross-layer wireless control policies using TD learning
We present an on-line crosslayer control technique to characterize and approximate optimal policies for wireless networks. Our approach combines network utility maximization and ad...
Sean P. Meyn, Wei Chen, Daniel O'Neill
SI3D
2009
ACM
14 years 2 months ago
Real-time view-dependent rendering of parametric surfaces
We propose a view-dependent adaptive subdivision algorithm for rendering parametric surfaces on parallel hardware. Our framework allows us to bound the screen space error of a pie...
Christian Eisenacher, Quirin Meyer, Charles T. Loo...
AIA
2007
13 years 9 months ago
Optimizing number of hidden neurons in neural networks
In this paper, a novel and effective criterion based on the estimation of the signal-to-noise-ratio figure (SNRF) is proposed to optimize the number of hidden neurons in neural ne...
Yue Liu, Janusz A. Starzyk, Zhen Zhu