Sciweavers

10608 search results - page 607 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
AIPS
2004
15 years 8 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
GRAPHICSINTERFACE
2003
15 years 8 months ago
Multi-Resolution Point-Sample Raytracing
We propose a new strategy for raytracing complex scenes without aliasing artifacts. The algorithm intersects anisotropic ray cones with prefiltered surface sample points from a mu...
Michael Wand, Wolfgang Straßer
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
15 years 8 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
CORR
2006
Springer
102views Education» more  CORR 2006»
15 years 7 months ago
On the User Selection for MIMO Broadcast Channels
1 In this paper, we consider a downlink communication system, in which a base station (BS) equipped with M antennas communicates with N users each equipped with K receive antennas....
Alireza Bayesteh, Amir K. Khandani
KES
2006
Springer
15 years 7 months ago
Sensor Network Localization Using Least Squares Kernel Regression
Abstract. This paper considers the sensor network localization problem using signal strength. Unlike range-based methods signal strength information is stored in a kernel matrix. L...
Anthony Kuh, Chaopin Zhu, Danilo P. Mandic