搜索结果: 61-75 共查到“理学 algorithms”相关记录191条 . 查询时间(1.297 秒)
Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms
Approximate M-Ellipsoid Lattice Algorithms Computational Complexity
font style='font-size:12px;'>
2011/10/9
Abstract: We give a deterministic O(log n)^n algorithm for the {\em Shortest Vector Problem (SVP)} of a lattice under {\em any} norm, improving on the previous best deterministic bound of n^O(n) for g...
Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization
nonnegative matrix factorization algorithms multiplicative updates hierarchical alternating least squares
font style='font-size:12px;'>
2011/9/21
Abstract: Nonnegative matrix factorization (NMF) is a data analysis technique used in a great variety of applications such as text mining, image processing, hyperspectral data analysis, computational ...
Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms
Non-adaptive probabilistic group noisy measurements Near-optimal bounds efficient algorithms
font style='font-size:12px;'>
2011/9/19
Abstract: We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noi...
Stochastic Service Systems, Random Interval Graphs and Search Algorithms
Queueing theory interval graphs Lambert series asymptotic expansions
font style='font-size:12px;'>
2011/9/15
Abstract: We consider several stochastic service systems, and study the asymptotic behavior of the moments of various quantities that have application to models for random interval graphs and algorith...
Evaluating Data Assimilation Algorithms
Data Assimilation Algorithms Data Analysis Statistics and Probability
font style='font-size:12px;'>
2011/10/9
Abstract: Data assimilation refers to methodologies for the incorporation of noisy observations of a physical system into an underlying model in order to infer the properties of the state of the syste...
Explicit n-descent on elliptic curves. III. Algorithms
Explicit n-descent elliptic curves Algorithms Number Theory
font style='font-size:12px;'>
2011/9/14
Abstract: This is the third in a series of papers in which we study the n-Selmer group of an elliptic curve, with the aim of representing its elements as genus one normal curves of degree n. The metho...
Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint
Sparse Principal Component Analysis PCA Conditional Gradient Algorithms Sparse Eigenvalue Problems
font style='font-size:12px;'>
2011/8/26
Abstract: The sparsity constrained rank-one matrix approximation problem is a difficult mathematical optimization problem which arises in a wide array of useful applications in engineering, machine le...
A continuum solvent model: the DISOLV program - algorithms, implementation, and validation
polarized continuum model conductor-like screening model solvent accessible surface triangulation non-polar interactions polar interactions
font style='font-size:12px;'>
2011/8/2
Abstract: Several implicit (continuum) solvent models are considered: the Polarized Continuum Model (PCM), the Surface Generalized Born model (SGB), and the COnductor-like Screening model (COSMO) as w...
Simulated Performance Of Algorithms For The Localization Of Radioactive Sources From A Position Sensitive Radiation Detecting System (COCAE)
Monte Carlo simulations, Semiconductor detectors, Gamma-ray spectroscopy,Compton camera
font style='font-size:12px;'>
2011/9/8
Simulation studies are presented regarding the performance of algorithms that localize point-like radioactive sources detected by a position sensitive portable radiation instrument (COCAE). The source...
Evaluating Data Assimilation Algorithms
Evaluate Data Assimilation Algorithms assimilation refers
font style='font-size:12px;'>
2011/8/5
Abstract: Data assimilation refers to methodologies for the incorporation of noisy observations of a physical system into an underlying model in order to infer the properties of the state of the syste...
Distributed Local Broadcasting Algorithms in the Physical Interference Model
Local Broadcasting Algorithms Physical Interference Model
font style='font-size:12px;'>
2012/11/30
Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is to schedule all these re...
Algorithms for Highly Symmetric Linear and Integer Programs
Algorithms Highly Symmetric Linear Integer Programs
font style='font-size:12px;'>
2011/2/25
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear progra...
A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms
Lanczos Method Singular Value Decomposition Eigenvalue
font style='font-size:12px;'>
2011/3/1
Recent years have witnessed the popularity of using rank minimization as a regularizer for various signal processing and machine learning problems.
Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers
Lucas numbers algorithms iteration recursion Fibonacci
font style='font-size:12px;'>
2011/3/1
A fast and simple O(log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a √5 conversion...
Average Minimum Transmit Power to achieve SINR Targets: Performance Comparison of Various User Selection Algorithms
Average Minimum Transmit Power SINR Targets Performance Comparison of Various User Selection Algorithms
font style='font-size:12px;'>
2011/1/17
In multi-user communication from one base station (BS) to multiple users, the problem of minimizing the transmit power to achieve some target guaranteed performance (rates) at users has been well inve...