Kevin J. Lang
According to our database1, Kevin J. Lang authored at least 39 papers between 1985 and 2017.
Legend:Book In proceedings Article PhD thesis Other
A high-performance algorithm for identifying frequent items in data streams.
Proceedings of the 2017 Internet Measurement Conference, 2017
Stratified Sampling Meets Machine Learning.
Proceedings of the 33nd International Conference on Machine Learning, 2016
A Framework for Estimating Stream Expression Cardinalities.
Proceedings of the 19th International Conference on Database Theory, 2016
Optimal Quantile Approximation in Streams.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Bargaining for Revenue Shares on Tree Trading Networks.
Proceedings of the IJCAI 2013, 2013
Handling forecast errors while bidding for display advertising.
Proceedings of the 21st World Wide Web Conference 2012, 2012
Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012
Efficient online ad serving in a display advertising exchange.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011
Empirical comparison of algorithms for network community detection.
Proceedings of the 19th International Conference on World Wide Web, 2010
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters.
Internet Mathematics, 2009
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments.
Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009
Statistical properties of community structure in large social and information networks.
Proceedings of the 17th International Conference on World Wide Web, 2008
An algorithm for improving graph partitions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Efficient Discovery of Authoritative Resources.
Proceedings of the 24th International Conference on Data Engineering, 2008
Using PageRank to Locally Partition a Graph.
Internet Mathematics, 2007
Local Partitioning for Directed Graphs Using PageRank.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007
Finding dense and isolated submarkets in a sponsored search spending graph.
Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007
Communities from seed sets.
Proceedings of the 15th international conference on World Wide Web, 2006
Local Graph Partitioning using PageRank Vectors.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
Fixing two weaknesses of the Spectral Method.
Proceedings of the Advances in Neural Information Processing Systems 18 [Neural Information Processing Systems, 2005
A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
Portable and Efficient Parallel Computing Using the BSP Model.
IEEE Trans. Computers, 1999
BOS is Boss: A Case for Bulk-Synchronous Object Systems.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999
BSPlib: The BSP programming library.
Parallel Computing, 1998
Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm.
Proceedings of the Grammatical Inference, 4th International Colloquium, 1998
Towards Efficiency and Portability: Programming with the BSP Model.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996
Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis Problem of Koza's.
Proceedings of the Machine Learning, 1995
Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret.
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994
A Test Suite for Chess Programs.
ICGA Journal, 1993
Finding Near-Optimal Cuts: An Empirical Evaluation.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993
Random DFA's Can Be Approximately Learned from Sparse Uniform Examples.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992
A time-delay neural network architecture for isolated word recognition.
Neural Networks, 1990
Constructing Hidden Units Using Examples and Queries.
Proceedings of the Advances in Neural Information Processing Systems 3, 1990
Phoneme recognition using time-delay neural networks.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1989
Dimensionality Reduction and Prior Knowledge in E-Set Recognition.
Proceedings of the Advances in Neural Information Processing Systems 2, 1989
Oaklisp: An Object-Oriented Dialect of Scheme.
Lisp and Symbolic Computation, 1988
Oaklisp: an Object-Oriented Scheme with First Class Types.
Proceedings of the Conference on Object-Oriented Programming Systems, 1986
Shape Recognition and Illusory Conjunctions.
Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985