Sciweavers

24095 search results - page 4679 / 4819
» Researchers and Development - Young Researches
Sort
View
CPHYSICS
2007
71views more  CPHYSICS 2007»
15 years 6 months ago
Simulation of n-qubit quantum systems. III. Quantum operations
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
T. Radtke, S. Fritzsche
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JAL
2006
114views more  JAL 2006»
15 years 6 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
JNW
2008
71views more  JNW 2008»
15 years 6 months ago
Enhancement of Delivery of Warning Messages for Mobile Networks
Vehicle-to-vehicle (V2V) communication systems have been studied extensively in recent years by transportation experts worldwide. Such systems enable the transmission of warning me...
Chia-Sheng Tsai, Wun-Kai Du
DAM
2007
107views more  DAM 2007»
15 years 6 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
« Prev « First page 4679 / 4819 Last » Next »