咨询与建议

限定检索结果

文献类型

  • 19 篇 会议
  • 3 篇 期刊文献
  • 1 册 图书

馆藏范围

  • 23 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 8 篇 工学
    • 7 篇 计算机科学与技术...
    • 2 篇 信息与通信工程
    • 1 篇 机械工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 电子科学与技术(可...
    • 1 篇 软件工程
    • 1 篇 生物工程
  • 7 篇 理学
    • 5 篇 数学
    • 2 篇 统计学(可授理学、...
    • 1 篇 物理学
    • 1 篇 化学
    • 1 篇 生物学
    • 1 篇 系统科学
  • 3 篇 管理学
    • 3 篇 管理科学与工程(可...
    • 1 篇 工商管理

主题

  • 3 篇 fault tolerance
  • 3 篇 vectors
  • 2 篇 eigenvalues and ...
  • 2 篇 approximation al...
  • 2 篇 optimization
  • 2 篇 computational mo...
  • 1 篇 randomized commu...
  • 1 篇 poset dimension
  • 1 篇 runtime
  • 1 篇 information syst...
  • 1 篇 iterative refine...
  • 1 篇 graph algorithms
  • 1 篇 distributed algo...
  • 1 篇 computational co...
  • 1 篇 buchi objectives
  • 1 篇 chebyshev approx...
  • 1 篇 sparks
  • 1 篇 saddle point/equ...
  • 1 篇 computer archite...
  • 1 篇 graph games

机构

  • 9 篇 research group t...
  • 6 篇 university of vi...
  • 2 篇 institute of tel...
  • 2 篇 theory and appli...
  • 1 篇 sustainable comp...
  • 1 篇 department of ma...
  • 1 篇 department of ma...
  • 1 篇 theory and appli...
  • 1 篇 school of comput...
  • 1 篇 research group t...
  • 1 篇 information syst...
  • 1 篇 austria
  • 1 篇 university of vi...
  • 1 篇 research group e...
  • 1 篇 theory and appli...
  • 1 篇 university of pe...
  • 1 篇 division of math...
  • 1 篇 department of co...
  • 1 篇 research group t...
  • 1 篇 computer distrib...

作者

  • 10 篇 wilfried n. gans...
  • 3 篇 hana strakova
  • 3 篇 gansterer wilfri...
  • 3 篇 hana straková
  • 3 篇 gerhard niederbr...
  • 3 篇 niederbrucker ge...
  • 2 篇 nanongkai danupo...
  • 2 篇 sarma atish das
  • 2 篇 andreas janecek
  • 1 篇 markus rupp
  • 1 篇 thang viet huynh
  • 1 篇 peleg david
  • 1 篇 reinprecht peter
  • 1 篇 ondrej slučiak
  • 1 篇 franz hlawatsch
  • 1 篇 tschiatschek seb...
  • 1 篇 lall ashwin
  • 1 篇 junzhi li
  • 1 篇 monika henzinger
  • 1 篇 korman amos

语言

  • 23 篇 英文
检索条件"机构=Research Group Theory and Applications of Algorithms"
23 条 记 录,以下是1-10 订阅
排序:
DISTRIBUTED DECORRELATION IN SENSOR NETWORKS WITH APPLICATION TO DISTRIBUTED PARTICLE FILTERING
DISTRIBUTED DECORRELATION IN SENSOR NETWORKS WITH APPLICATIO...
收藏 引用
IEEE International Conference on Acoustics, Speech and Signal Processing
作者: Michael Moldaschl Wilfried N. Gansterer Ondrej Hlinka Florian Meyer Franz Hlawatsch University of Vienna Research Group Theory and Applications of Algorithms Vienna Austria Institute of Telecommunications Vienna University of Technology Vienna Austria
Most distributed statistical signal processing methods assume conditionally uncorrelated sensor measurements although this assumption is often not satisfied. Here, we propose a distributed algorithm for decorrelating ... 详细信息
来源: 评论
Swarm/evolutionary intelligence for agent-based social simulation
Swarm/evolutionary intelligence for agent-based social simul...
收藏 引用
Congress on Evolutionary Computation
作者: Andreas Janecek Tobias Jordan Fernando Buarque de Lima-Neto University of Vienna Austria Research Group Theory and Applications of Algorithms University of Pernambuco Re-cifelPE Brazil Polytechnic School of Engineering/Computing Engineering Program
Several micro economic models allow to evaluate consumer's behavior using a utility function that is able to measure the success of an individual's decision. Such a decision may consist of a tuple of goods an ... 详细信息
来源: 评论
Dynamic search in fireworks algorithm
Dynamic search in fireworks algorithm
收藏 引用
Congress on Evolutionary Computation
作者: Shaoqiu Zheng Andreas Janecek Junzhi Li Ying Tan Department of Machine Intelligence Peking University Beijing P.R. China Research Group Theory and Applications of Algorithms University of Vienna Vienna Austria
We propose an improved version of the recently developed Enhanced Fireworks Algorithm (EFWA) based on an adaptive dynamic local search mechanism. In EFWA, the explosion amplitude (i.e., search area around the current ... 详细信息
来源: 评论
Robust gossip-based aggregation: A practical point of view  15
Robust gossip-based aggregation: A practical point of view
收藏 引用
15th Workshop on Algorithm Engineering and Experiments, ALENEX 2013
作者: Niederbrucker, Gerhard Gansterer, Wilfried N. University of Vienna Research Group Theory and Applications of Algorithms Austria
Over the last years, several gossip-based aggregation algorithms have been developed which focus on providing resilience in failure-prone distributed systems. The main objective of such algorithms is the efficient in-... 详细信息
来源: 评论
Fault Tolerance Properties of Gossip-Based Distributed Orthogonal Iteration Methods
收藏 引用
Procedia Computer Science 2013年 18卷 189-198页
作者: Hana Straková Gerhard Niederbrucker Wilfried N. Gansterer University of Vienna Research Group Theory and Applications of Algorithms Austria
In this paper, we investigate and compare the fault tolerance properties and resilience of gossip-based distributed orthog- onal iteration algorithms for the in-network computation of the extreme eigenpairs of matrix.... 详细信息
来源: 评论
On Mixed Precision Iterative Refinement for Eigenvalue Problems
收藏 引用
Procedia Computer Science 2013年 18卷 2647-2650页
作者: Karl E. Prikopa Wilfried N. Gansterer University of Vienna Research Group Theory and Applications of Algorithms Austria
We investigate novel iterative refinement methods for solving eigenvalue problems which are derived from Newton's method. In particular, approaches for the solution of the resulting linear system based on saddle p... 详细信息
来源: 评论
A Distributed Eigensolver for Loosely Coupled Networks
A Distributed Eigensolver for Loosely Coupled Networks
收藏 引用
Euromicro Conference on Parallel, Distributed and Network-Based Processing
作者: Hana Strakova Wilfried N. Gansterer Research Group Theory and Applications of Algorithms University of Vienna Vienna Austria
We introduce a new distributed eigensolver (dOI) for square matrices based on orthogonal iteration. In contrast to standard parallel eigensolvers, our approach performs only nearest neighbor communication and provides... 详细信息
来源: 评论
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More  13
Graph Products Revisited: Tight Approximation Hardness of In...
收藏 引用
Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms
作者: Parinya Chalermsook Bundit Laekhanukit Danupon Nanongkai IDSIA School of Computer Science McGill University Theory and Applications of Algorithms Research Group University of Vienna
Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually studied in the form f(G * H) where G and H are graphs, * is a graph product and f is a gr... 详细信息
来源: 评论
An O(n2) time algorithm for alternating Büchi games
An O(n2) time algorithm for alternating Büchi games
收藏 引用
23rd Annual ACM-SIAM Symposium on Discrete algorithms, SODA 2012
作者: Chatterjee, Krishnendu Henzinger, Monika Austria Research Group Theory and Applications of Algorithms University of Vienna Austria
Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for ... 详细信息
来源: 评论
Bayesian network classifiers with reduced precision parameters
Bayesian network classifiers with reduced precision paramete...
收藏 引用
2012 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML-PKDD 2012
作者: Tschiatschek, Sebastian Reinprecht, Peter Mücke, Manfred Pernkopf, Franz Signal Processing and Speech Communication Laboratory Graz University of Technology Graz Austria University of Vienna Research Group Theory and Applications of Algorithms Vienna Austria Sustainable Computing Research Austria
Bayesian network classifiers (BNCs) are probabilistic classifiers showing good performance in many applications. They consist of a directed acyclic graph and a set of conditional probabilities associated with the node... 详细信息
来源: 评论