Complexity theory is a branch of computer science that studies the resources required to solve computational problems, particularly focusing on the classification of problems based on their inherent ...
Voting theory is an interdisciplinary field that examines and evaluates the procedures and algorithms underlying collective decision‐making. Recently, researchers have focused on bridging voting ...
Outlier detection algorithms are intimately connected with robust statistics that down-weight some observations to zero. We define a number of outlier detection algorithms related to the Huber-skip ...
WEST LAFAYETTE, Ind. — In 2019, Google claimed it was the first to demonstrate a quantum computer performing a calculation beyond the abilities of today’s most powerful supercomputers. But most of the ...
An intensive course which begins by providing attendees with a solid and intuitive understanding of the essential dsp tools, such as digital filters, FFTs, correlators, adaptive systems and multirate ...
Scientists have found what they say is a link between complex number theory and string theory. A mathematician and physicist working together found the connection, which they say is part of plotting ...
A new theory could bring a way to make quantum algorithm development less of an accidental process, say scientists. In 2019, Google claimed it was the first to demonstrate a quantum computer ...
On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...
Imagine a town with two widget merchants. Customers prefer cheaper widgets, so the merchants must compete to set the lowest price. Unhappy with their meager profits, they meet one night in a ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback