Sciweavers

1158 search results - page 180 / 232
» Software is discrete mathematics
Sort
View
FCT
2003
Springer
15 years 11 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
191
Voted
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 10 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
158
Voted
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 10 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
CDC
2009
IEEE
176views Control Systems» more  CDC 2009»
15 years 10 months ago
Controllability of the rotation of a quantum planar molecule
Abstract— We consider the simplest model for controlling the rotation of a molecule by the action of an electric field, namely a quantum planar pendulum. This problem consists i...
Ugo V. Boscain, Thomas Chambrion, Paolo Mason, Mar...
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 9 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani