Sciweavers

522 search results - page 3 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
CORR
2000
Springer
85views Education» more  CORR 2000»
13 years 7 months ago
Phutball Endgames are Hard
We show that, in John Conway's board game Phutball (or Philosopher's Football), it is NP-complete to determine whether the current player has a move that immediately wins...
Erik D. Demaine, Martin L. Demaine, David Eppstein
COCOON
2009
Springer
14 years 2 months ago
Determination of Glycan Structure from Tandem Mass Spectra
Glycans are molecules made from simple sugars that form complex tree structures. Glycans constitute one of the most important protein modifications, and identification of glycans...
Sebastian Böcker, Birte Kehr, Florian Rasche
TSD
2007
Springer
14 years 1 months ago
On the Relative Hardness of Clustering Corpora
Abstract. Clustering is often considered the most important unsupervised learning problem and several clustering algorithms have been proposed over the years. Many of these algorit...
David Pinto, Paolo Rosso
CAEPIA
2009
Springer
13 years 9 months ago
Empirical Hardness for Mixed Auctions
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, little is known about the fac...
Pablo Almajano, Jesús Cerquides, Juan A. Ro...
FTCIT
2007
77views more  FTCIT 2007»
13 years 7 months ago
Cyclic Division Algebras: A Tool for Space-Time Coding
Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission channel may increase both data rate and reliability. Reliable high rate transmission...
Frédérique E. Oggier, Jean-Claude Be...