Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
A goal of computing and networking systems is to limit administrative requirements for users and operators. A technical systems should be able to configure itself as much as possi...
Abstract. We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to con...
Mikhail A. Roytberg, Anna Gambin, Laurent No&eacut...
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...