# Hung Q. Ngo

According to our database

Collaborative distances:

^{1}, Hung Q. Ngo authored at least 78 papers between 1999 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2018

Worst-case Optimal Join Algorithms.

J. ACM, 2018

Towards self-learning based hypotheses generation in biomedical text domain.

Bioinformatics, 2018

AC/DC: In-Database Learning Thunderstruck.

Proceedings of the Second Workshop on Data Management for End-To-End Machine Learning, 2018

In-Database Learning with Sparse Tensors.

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems.

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Counting Triangles under Updates.

Proceedings of the 12th Alberto Mendelzon International Workshop on Foundations of Data Management, 2018

2017

Juggling Functions Inside a Database.

SIGMOD Record, 2017

What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

In-Database Factorized Learning.

Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, 2017

2016

Efficient Decodable Group Testing.

Encyclopedia of Algorithms, 2016

Computing Join Queries with Functional Dependencies.

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

FAQ: Questions Asked Frequently.

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Why Regularized Auto-Encoders learn Sparse Representation?

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

Join Processing for Graph Patterns: An Old Dog with New Tricks.

Proceedings of the Third International Workshop on Graph Data Management Experiences and Systems, 2015

Joins via Geometric Resolutions: Worst-case and Beyond.

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

2014

On handling negative transfer and imbalanced distributions in multiple source transfer learning.

Statistical Analysis and Data Mining, 2014

Matching Titles with Cross Title Web-Search Enrichment and Community Detection.

PVLDB, 2014

Assisting Students in Finding Bugs and their Locations in Programming Solutions.

IJQAETE, 2014

Beyond worst-case analysis for joins with minesweeper.

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Parallel Feature Selection Inspired by Group Testing.

Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013

Skew strikes back: new developments in the theory of join algorithms.

SIGMOD Record, 2013

Black-Box Trace&Revoke Codes.

Algorithmica, 2013

Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing.

Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

On Handling Negative Transfer and Imbalanced Distributions in Multiple Source Transfer Learning.

Proceedings of the 13th SIAM International Conference on Data Mining, 2013

ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk.

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors.

J. Comb. Optim., 2012

Bregman divergence based sensor selections for spectrum sensing.

Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, 2012

Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion.

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Worst-case optimal join algorithms: [extended abstract].

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

2011

A linear programming duality approach to analyzing strictly nonblocking

*d*-ary multilog networks under general crosstalk constraints.
J. Comb. Optim., 2011

Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract).

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Brief announcement: on regenerator placement problems in optical networks.

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Efficiently Decodable Non-adaptive Group Testing.

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

A Data-Centric Approach to Insider Attack Detection in Database Systems.

Proceedings of the Recent Advances in Intrusion Detection, 13th International Symposium, 2010

Analyzing Nonblocking Switching Networks using Linear Programming (Duality).

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

Steiner Tree Problems.

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On the trade-off between speed and resiliency of Flash worms and similar malcodes.

Journal in Computer Virology, 2009

MoPADS: A Mobility Profile Aided File Downloading Service in Vehicular Networks.

IEEE Trans. Vehicular Technology, 2009

Rearrangeable and nonblocking [w, f] -distributors.

IEEE/ACM Trans. Netw., 2009

Analyzing Nonblocking Multilog Networks with the köNIG-Egevarý Theorem.

Discrete Math., Alg. and Appl., 2009

Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem.

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

On the effectiveness of structural detection and defense against P2P-based botnets.

Proceedings of the 2009 IEEE/IFIP International Conference on Dependable Systems and Networks, 2009

2008

On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design.

J. Comb. Optim., 2008

Strictly Nonblocking Function-Cast d-Ary Multi-Log Networks under Fanout and Crosstalk Constraints.

Proceedings of IEEE International Conference on Communications, 2008

Strictly Nonblocking f-Cast Photonic Switching Networks under General Crosstalk Constraints.

Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

Crosstalk-Free Widesense Nonblocking Multicast Photonic Switching Networks.

Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

CRESTBOT: A New Family of Resilient Botnets.

Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

Insider abuse comprehension through capability acquisition graphs.

Proceedings of the 11th International Conference on Information Fusion, 2008

A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints.

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks.

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Insider Threat Analysis Using Information-Centric Modeling.

Proceedings of the Advances in Digital Forensics III, 2007

2006

Constructions and analyses of nonblocking WDM switches based on arrayed waveguide grating and limited wavelength conversion.

IEEE/ACM Trans. Netw., 2006

Minimum Cost Wireless Broadband Overlay Network Planning.

Proceedings of the 2006 International Symposium on a World of Wireless, 2006

On profiling mobility and predicting locations of wireless users.

Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality, 2006

Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN).

Proceedings of the International Conference on Wireless Communications and Mobile Computing, 2006

Routing on Overlay Graphs in Mobile Ad Hoc Networks.

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005

WDM Switching Networks, Rearrangeable and Nonblocking [

*w, f*]-connectors.
SIAM J. Comput., 2005

On the Hardness of Approximating the Min-Hack Problem.

J. Comb. Optim., 2005

CQMP: a mesh-based multicast routing protocol with consolidated query packets.

Proceedings of the IEEE Wireless Communications and Networking Conference, 2005

Optical switching networks with minimum number of limited range wavelength converters.

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Towards a Theory of Insider Threat Assessment.

Proceedings of the 2005 International Conference on Dependable Systems and Networks (DSN 2005), 28 June, 2005

2004

Transmission fault-tolerance of iterated line digraphs.

Journal of Interconnection Networks, 2004

Nonblocking WDM Switches Based on Arrayed Waveguide Grating and Limited Wavelength Conversion.

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Cost-effective constructions for nonblocking WDM multicast switching networks.

Proceedings of IEEE International Conference on Communications, 2004

2003

A new routing algorithm for multirate rearrangeable Clos networks.

Theor. Comput. Sci., 2003

Super link-connectivity of iterated line digraphs.

Theor. Comput. Sci., 2003

Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

MIP3S: algorithms for power-conserving multicasting in static wireless ad hoc networks.

Proceedings of the 11th IEEE International Conference on Networks, 2003

2002

Error spreading: a perception-driven approach to handling error in continuous media streaming.

IEEE/ACM Trans. Netw., 2002

Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1.

SIAM J. Discrete Math., 2002

New bounds on a hypercube coloring problem.

Inf. Process. Lett., 2002

New constructions of non-adaptive and error-tolerance pooling designs.

Discrete Mathematics, 2002

On connectivity of consecutive-

*d*digraphs.
Discrete Mathematics, 2002

2001

Optimal Consecutive-k-out-of-(2k+1): G Cycle.

J. Global Optimization, 2001

New Bounds on a Hypercube Coloring Problem and Linear Codes.

Proceedings of the 2001 International Symposium on Information Technology (ITCC 2001), 2001

2000

An Adaptive, Perception-Driven Error Spreading Scheme in Continuous Media Streaming.

Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

1999

Error Spreading: Reducing Bursty Errors in Continuous Media Streaming.

Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

A survey on combinatorial group testing algorithms with applications to DNA Library Screening.

Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999