Results 321 to 330 of about 22,856,606 (379)
Some of the next articles are maybe not open access.
Span programs and quantum time complexity
International Symposium on Mathematical Foundations of Computer Science, 2020Span programs are an important model of quantum computation due to their tight correspondence with quantum query complexity. For any decision problem $f$, the minimum complexity of a span program for $f$ is equal, up to a constant factor, to the quantum ...
A. Cornelissen +3 more
semanticscholar +1 more source
Visualizing Complex Notions of Time [PDF]
, 2001 Time plays an important role in medicine. Conditions are not just evaluated at single instants in time, but traced over periods. Medications must be administered within specified temporal limits, and their effects observed with regard to time.
Silvia Miksch, Robert Kosara
openaire +2 more sources
Accelerating Diffusion Models with Parallel Sampling: Inference at Sub-Linear Time Complexity
Neural Information Processing SystemsDiffusion models have become a leading method for generative modeling of both image and scientific data. As these models are costly to train and evaluate, reducing the inference cost for diffusion models remains a major goal.
Haoxuan Chen +3 more
semanticscholar +1 more source
The Time Complexity of Consensus Under Oblivious Message Adversaries
Information Technology Convergence and ServicesWe study the problem of solving consensus in synchronous directed dynamic networks, in which communication is controlled by an oblivious message adversary that picks the communication graph to be used in a round from a fixed set of graphs $$\textbf{D}$$
Kyrill Winkler +4 more
semanticscholar +1 more source
Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018Graph matching is essential in several fields that use structured information, such as biology, chemistry, social networks, knowledge management, document analysis and others.
Vincenzo Carletti +3 more
semanticscholar +1 more source
Influence maximization: near-optimal time complexity meets practical efficiency
SIGMOD Conference, 2014Given a social network G and a constant $k$, the influence maximization problem asks for k nodes in G that (directly and indirectly) influence the largest number of nodes under a pre-defined diffusion model.
Youze Tang, Xiaokui Xiao, Yanchen Shi
semanticscholar +1 more source
Optimal Time-Complexity Speed Planning for Robot Manipulators
IEEE Transactions on robotics, 2018In this paper, we consider the speed planning problem for a robotic manipulator. In particular, we present an algorithm for finding the time-optimal speed law along an assigned path that satisfies velocity and acceleration constraints and respects the ...
L. Consolini +4 more
semanticscholar +1 more source
Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle
International Joint Conference on Automated Reasoning, 2018We present a framework in Isabelle for verifying asymptotic time complexity of imperative programs. We build upon an extension of Imperative HOL and its separation logic to include running time.
Bohua Zhan, Maximilian P. L. Haslbeck
semanticscholar +1 more source
Complexity and the Arrow of Time [PDF]
, 2013 There is a widespread assumption that the universe in general, and life in particular, is 'getting more complex with time'. This book brings together a wide range of experts in science, philosophy and theology and unveils their joint effort in exploring this idea.
Paul Davies +2 more
openaire +1 more source
Sparse Semidefinite Programs with Near-Linear Time Complexity
IEEE Conference on Decision and Control, 2017Some of the strongest polynomial-time relaxations to NP-hard combinatorial optimization problems are semidefinite programs (SDPs), but their solution complexity of up to O(n6.5 L) time and O(n4) memory for $L$ accurate digits limits their use in all but ...
Richard Y. Zhang, J. Lavaei
semanticscholar +1 more source