Regant Y. S. Hung

According to our database1, Regant Y. S. Hung authored at least 11 papers between 2006 and 2012.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
An Efficient Representation Model of Distance Distribution between uncertain Objects.
Comput. Intell., 2012

2010
Finding frequent items over sliding windows with constant update time.
Inf. Process. Lett., 2010

Design and Analysis of Online Batching Systems.
Algorithmica, 2010

An W(\frac1e log\frac1e)\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon}) Space Lower Bound for Finding <i>epsilon</i>-Approximate Quantiles in a Data Stream.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009
The complexities of tracking quantiles and frequent items in a data stream
PhD thesis, 2009

A Near-Optimal Broadcasting Protocol for Mobile Video-on-Demand.
Int. J. Found. Comput. Sci., 2009

2008
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay.
Theor. Comput. Sci., 2008

Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Finding Frequent Items in a Turnstile Data Stream.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
An Optimal Broadcasting Protocol for Mobile Video-on-Demand.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006
A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006


  Loading...