Sciweavers

11740 search results - page 418 / 2348
» More Problems in Rewriting
Sort
View
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
16 years 9 days ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
WABI
2005
Springer
16 years 9 days ago
Minimum Recombination Histories by Branch and Bound
Recombination plays an important role in creating genetic diversity within species, and inferring past recombination events is central to many problems in genetics. Given a set M o...
Rune B. Lyngsø, Yun S. Song, Jotun Hein
SPAA
2004
ACM
16 years 7 days ago
Balanced graph partitioning
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
Konstantin Andreev, Harald Räcke
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
16 years 6 days ago
On the Power of Quantum Proofs
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
Ran Raz, Amir Shpilka
187
Voted
EUROPAR
2004
Springer
16 years 6 days ago
Near-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
Costas Busch, Malik Magdon-Ismail, Marios Mavronic...