Sciweavers

1491 search results - page 191 / 299
» Training Linear Discriminant Analysis in Linear Time
Sort
View
CAIP
2007
Springer
132views Image Analysis» more  CAIP 2007»
15 years 4 months ago
Decomposing a Simple Polygon into Trapezoids
Chazelle’s triangulation [1] forms today the common basis for linear-time Euclidean shortest path (ESP) calculations (where start and end point are given within a simple polygon)...
Fajie Li, Reinhard Klette
85
Voted
CCCG
2003
14 years 11 months ago
Multidimensional Orthogonal Range Search Using Tries
We present a novel k-dimensional range search algorithm for reporting all k-d rectangles from a set D of size n intersecting a query rectangle. Our algorithm uses 2kd tries to sol...
Lingke Bu, Bradford G. Nickerson
CDC
2010
IEEE
124views Control Systems» more  CDC 2010»
14 years 5 months ago
A relaxation of Lyapunov conditions and controller synthesis for discrete-time periodic systems
This paper proposes a novel approach to stability analysis and controller synthesis for discrete-time periodically time-varying systems. Firstly, a relaxation of standard Lyapunov ...
Christoph Bohm, Mircea Lazar, Frank Allgöwer
JCC
2011
133views more  JCC 2011»
14 years 4 months ago
MIBPB: A software package for electrostatic analysis
: The Poisson–Boltzmann equation (PBE) is an established model for the electrostatic analysis of biomolecules. The development of advanced computational techniques for the soluti...
Duan Chen, Zhan Chen, Changjun Chen, Weihua Geng, ...
TSP
2010
14 years 4 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat