Sciweavers

393 search results - page 47 / 79
» The LCA Problem Revisited
Sort
View
STOC
2004
ACM
86views Algorithms» more  STOC 2004»
16 years 2 months ago
Using nondeterminism to amplify hardness
We revisit the problem of hardness amplification in NP, as recently studied by O'Donnell (STOC `02). We prove that if NP has a balanced function f such that any circuit of si...
Alexander Healy, Salil P. Vadhan, Emanuele Viola
GLOBECOM
2008
IEEE
15 years 8 months ago
Adaptive Multicast Tree Construction for Elastic Data Streams
— In this paper, we revisit the problem of multicast tree construction in overlay peer-to-peer networks. We present an iterative online multicast tree construction algorithm for ...
Ying Zhu, Ken Q. Pu
DRR
2008
15 years 3 months ago
Versatile page numbering analysis
In this paper, we revisit the problem of detecting the page numbers of a document. This work is motivated by a need for a generic method which applies on a large variety of docume...
Hervé Déjean, Jean-Luc Meunier
CCCG
2006
15 years 3 months ago
Tight Bounds for Point Recolouring
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
Yurai Núñez Rodríguez, David ...
MSV
2004
15 years 3 months ago
On the Conversion between Number Systems
This brief revisits the problem of conversion between number systems and asks the following question: given a nonnegative decimal number , what is the value of the digit at positio...
Houssain Kettani