咨询与建议

限定检索结果

文献类型

  • 137 篇 期刊文献
  • 27 篇 会议
  • 6 篇 学位论文
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 140 篇 工学
    • 126 篇 计算机科学与技术...
    • 51 篇 电气工程
    • 19 篇 软件工程
    • 10 篇 信息与通信工程
    • 6 篇 仪器科学与技术
    • 6 篇 控制科学与工程
    • 3 篇 电子科学与技术(可...
    • 2 篇 石油与天然气工程
    • 1 篇 机械工程
    • 1 篇 动力工程及工程热...
    • 1 篇 交通运输工程
  • 61 篇 理学
    • 55 篇 数学
    • 11 篇 统计学(可授理学、...
    • 6 篇 生物学
    • 3 篇 化学
    • 1 篇 物理学
  • 7 篇 管理学
    • 7 篇 管理科学与工程(可...
  • 2 篇 经济学
    • 2 篇 应用经济学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 171 篇 probabilistic al...
  • 9 篇 machine learning
  • 6 篇 parallel algorit...
  • 5 篇 approximation al...
  • 5 篇 tracking
  • 5 篇 finite fields
  • 4 篇 reliability
  • 4 篇 clustering
  • 4 篇 algorithms
  • 4 篇 analysis of algo...
  • 4 篇 distributed algo...
  • 4 篇 biology and gene...
  • 3 篇 computational co...
  • 3 篇 random graphs
  • 3 篇 geometric soluti...
  • 3 篇 polynomial
  • 3 篇 markov processes
  • 3 篇 computational ge...
  • 3 篇 primality
  • 3 篇 decision trees

机构

  • 3 篇 technion israel ...
  • 3 篇 univ buenos aire...
  • 2 篇 agena ltd cambri...
  • 2 篇 univ nacl gen sa...
  • 2 篇 univ cambridge d...
  • 2 篇 cornell univ dep...
  • 2 篇 vrije univ amste...
  • 2 篇 google inc mount...
  • 2 篇 northwestern uni...
  • 2 篇 queen mary univ ...
  • 2 篇 brno university ...
  • 2 篇 idiap res inst c...
  • 2 篇 inst tecnol buen...
  • 2 篇 core secur techn...
  • 1 篇 universidad vera...
  • 1 篇 the work of the ...
  • 1 篇 crytek r&d dept ...
  • 1 篇 univ malaga dept...
  • 1 篇 univ pisa dipart...
  • 1 篇 fgan fom ettling...

作者

  • 4 篇 alt helmut
  • 4 篇 scharf ludmila
  • 3 篇 matera guillermo
  • 2 篇 garcia j. c.
  • 2 篇 srinivasan a
  • 2 篇 ezome tony
  • 2 篇 pizarro d.
  • 2 篇 kaski samuel
  • 2 篇 pang jun
  • 2 篇 juan angel a.
  • 2 篇 naor m
  • 2 篇 moran s
  • 2 篇 ciuffoletti a
  • 2 篇 devismes stephan...
  • 2 篇 waissbein ariel
  • 2 篇 solerno pablo
  • 2 篇 schymura daria
  • 2 篇 lercier reynald
  • 2 篇 neil martin
  • 2 篇 noguchi takao

语言

  • 166 篇 英文
  • 5 篇 其他
检索条件"主题词=Probabilistic algorithms"
171 条 记 录,以下是141-150 订阅
排序:
Nearly Optimal List Labeling  65
Nearly Optimal List Labeling
收藏 引用
65th Symposium on Foundations of Computer Science
作者: Bender, Michael A. Conway, Alex Farach-Colton, Martin Komlos, Hanna Koucky, Michal Kuszmaul, William Saks, Michael SUNY Stony Brook Stony Brook NY 11794 USA RelationalAI Stony Brook NY 11790 USA Cornell Tech New York NY USA NYU New York NY USA Charles Univ Prague Prague Czech Republic Carnegie Mellon Univ Pittsburgh PA USA Rutgers State Univ Piscataway NJ USA
The list-labeling problem captures the basic task of storing a dynamically changing set of up to n elements in sorted order in an array of size m = (1+ Theta(1))n. The goal is to support insertions and deletions while... 详细信息
来源: 评论
Ultrametric Vs. Quantum Query algorithms  3
Ultrametric Vs. Quantum Query Algorithms
收藏 引用
3rd International Conference on the Theory and Practice of Natural Computing (TPNC)
作者: Freivalds, Rusins Latvian State Univ Inst Math & Comp Sci LV-1459 Riga Latvia
Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. This paper introduces the notion of ultrametric query algorithms ... 详细信息
来源: 评论
Stochastic Processes and Markov Chains in Shape and Material Optimization Problems of Composite Structures  7
Stochastic Processes and Markov Chains in Shape and Material...
收藏 引用
7th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO)
作者: Muc, Aleksander Wygoda, Mateusz Cracow Univ Technol Inst Machine Design Krakow Poland
Commonly shape and material optimization for complex structures having complicated boundary and loading conditions requires FE analysis in order to determine accurately enough (especially for composite structures) obj... 详细信息
来源: 评论
CED2: Communication Efficient Disjointness Decision
CED<SUP>2</SUP>: Communication Efficient Disjointness Decisi...
收藏 引用
6th International Conference on Security and Privacy in Communication Networks (SecureComm 2010)
作者: Marconi, Luciana Conti, Mauro Di Pietro, Roberto Univ Roma La Sapienza Dept Comp Sci I-00198 Rome Italy Vrije Univ Amsterdam Dept Comp Sci NL-1081 HV Amsterdam Netherlands Univ Rome Tre Dept Math I-00146 Rome Italy
Enforcing security often requires the two legitimate parties of a communication to determine whether they share a secret, without disclosing information (e.g. the shared secret itself, or just the existence of such a ... 详细信息
来源: 评论
Brief Announcement: Asynchronous Bounded Expected Delay Networks
Brief Announcement: Asynchronous Bounded Expected Delay Netw...
收藏 引用
29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
作者: Bakhshi, Rena Endrullis, Jorg Fokkink, Wan Pang, Jun Vrije Univ Amsterdam Dept Comp Sci NL-1081 HV Amsterdam Netherlands
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is often too strict for real-life application... 详细信息
来源: 评论
An Application of Data Compression Models to Handwritten Digit Classification  19th
An Application of Data Compression Models to Handwritten Dig...
收藏 引用
19th International Conference on Advanced Concepts for Intelligent Vision Systems (ACIVS)
作者: Pinho, Armando J. Pratas, Diogo Univ Aveiro IEETA DETI Aveiro Portugal
In this paper, we address handwritten digit classification as a special problem of data compression modeling. The creation of the models usually known as training is just a process of counting. Moreover, the model ass... 详细信息
来源: 评论
The Effectiveness of Optimization algorithms in Shape and Topology Discrete Optimisation of 2-D Composite Structures  7
The Effectiveness of Optimization Algorithms in Shape and To...
收藏 引用
7th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO)
作者: Muc, A. Sanetra, I. Cracow Univ Technol Inst Mech & Machine Design Krakow Poland
The aim of the paper is to discuss the formulation and solution of optimisation problems for composite structures. A special attention is focused on the coding problems of design variables. The appropriate discrete co... 详细信息
来源: 评论
Comparing a Kalman Filter and a particle filter in a multiple objects tracking application
Comparing a Kalman Filter and a particle filter in a multipl...
收藏 引用
IEEE International Symposium on Intelligent Signal Processing
作者: Marron, M. Garcia, J. C. Sotelo, M. A. Cabello, M. Pizarro, D. Huerta, F. Cerro, J. Univ Alcala de Henares Dept Elect Alcala De Henares Spain
Two of the most important solutions in position estimation are compared, in this paper, in order to test their efficiency in a multi-tracking application in an unstructured and complex environment. A Particle Filter i... 详细信息
来源: 评论
Neighbour Aware Random Sampling (NARS) algorithm for load balancing in Cloud computing  1
Neighbour Aware Random Sampling (NARS) algorithm for load ba...
收藏 引用
IEEE International Conference on Electrical, Computer and Communication Technologies
作者: Ariharan, V Manakattu, Sheeja S. Bharat Elect Ltd Cent Res Lab Bengaluru India
Load balancing plays a vital role in Cloud computing to enhance throughput, optimize resource use and reduce response time. The main features to be considered while selecting a load balancing algorithm for cloud is th... 详细信息
来源: 评论
A probabilistic Algorithm for Secret Matrix Share Size Reduction
A Probabilistic Algorithm for Secret Matrix Share Size Reduc...
收藏 引用
European Wireless 2013;19th European Wireless Conference
作者: Eckhard Pfluegel Emmanouil Panaousis Christos Politis Wireless Multimedia & Networking (WMN) Research Group Kingston University London Queen Mary University of London
Secret sharing is an important tool in cryptography and has many applications for wireless networks. This paper is motivated by the need for space-efficient secret sharing schemes. We first propose a simple probabilis... 详细信息
来源: 评论