ABSTRACT Fast Discovery of Connection Subgraphs (2008)
Christos Faloutsos, Kevin S. Mccurley, Andrew Tomkins
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a paradigm for...
Language Modeling and Encryption on Packet Switched Networks ⋆ (2008)
Abstract. The holy grail of a mathematical model of secure encryption is to devise a model that is both faithful in its description of the real world, and yet admits a construction for an encryption...
Extracting Spatial Knowledge from the Web (2008)
Yasuhiko Morimoto (contact, Masaki Aono, Michael E. Houle, Kevin S. Mccurley
The content of the world-wide web is pervaded by information of a geographical or spatial na-ture, particularly such location information as addresses, postal codes, and telephone numbers. We present...
ABSTRACT Fast Discovery of Connection Subgraphs (2008)
Christos Faloutsos, Kevin S. Mccurley, Andrew Tomkins
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a paradigm for...
ABSTRACT Searching the Workplace Web (2007)
Ronald Fagin, Ravi Kumar, Kevin S. Mccurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, ...
The social impact from the World Wide Web cannot be underestimated, but technologies used to build the Web are also revolutionizing the sharing of business and government information within...
Ranking the Web Frontier (2004)
Eiron, Nadav, McCurley, Kevin S, Tomlin, John A
The celebrated PageRank algorithm has proved to be a very effective paradigm for ranking results of web search algorithms. In this paper we refine this basic paradigm to take into account several...
Searching the Workplace Web (2003)
Fagin, Ronald, Kumar, Ravi, McCurley, Kevin S., Novak, Jasmine, Sivakumar, D., Tomlin, John, ...
The social impact from the World Wide Web cannot be underestimated, but technologies used to build the Web are also revolutionizing the sharing of business and government information within...
Locality, hierarchy, and bidirectionality in the web (2003)
Nadav Eiron, Kevin S. Mccurley
The World Wide Web has been previously observed to be a “small world network” in which nodes are clustered together. We provide evidence, based on a crawl of over a billion pages, that such a...
A Case for Automated Large Scale Semantic Annotations (2003)
Stephen Dill, Nadav Eiron, David Gibson, Daniel Gruhl, R. Guha, Anant Jhingran, ...
This paper describes Seeker, a platform for large-scale text analytics, and SemTag, an application written on the platform to perform automated semantic tagging of large corpora. We apply SemTag to a...
Untangling Compound Documents on the Web (2003)
Nadav Eiron, Kevin S. McCurley
Most text analysis is designed to deal with the concept of a "document", namely a cohesive presentation of thought on a unifying subject. By contrast, individual nodes on the World Wide Web...
Geospatial Mapping and Navigation of the Web (2001)
Web pages may be organized, indexed, searched, and navigated along several different feature dimensions. We investigate different approaches to discovering geographic context for web pages, and...
Self-similarity in the web (2001)
Stephen Dill, Ravi Kumar, Kevin S. Mccurley, D. Sivakumar, Andrew Tomkins
Algorithmic tools for searching and mining the Web are becoming increasingly sophisticated and vital. In this context, algorithms that use and exploit structural information about the Web perform...
Surfing the Web Backwards (1999)
Soumen Chakrabarti, David A. Gibson, Kevin S. Mccurley
From a user’s perspective, hypertext links on the web form a directed graph between distinct information sources. We investigate the effects of discovering “backlinks ” from web resources,...
Fast exponentiation with precomputation: Algorithms and lower bounds (1995)
Ernest F. Brickell, Daniel M. Gordon, Kevin S. Mccurley, David B. Wilson
In several cryptographic systems, a fixed element g of a group of order N is repeatedly raised to many different powers. In this paper we present a practical method of speeding up such systems, using...
Fast Exponentiation with Precomputation: Algorithms and Lower Bounds (1995)
Lower Bounds, Ernest F. Brickell, Daniel M. Gordon, Kevin S. Mccurley, David B. Wilson
In several cryptographic systems, a fixed element g of a group of order N is repeatedly raised to many different powers. In this paper we present a practical method of speeding up such systems, using...
Sunmos Is, Arthur B. Maccabe, Kevin S. Mccurley, Rolf Riesen, Stephen R. Wheat
This document provides a quick overview of how to compile and run jobs using the SUNMOS environment on the Paragon. The primary goal of SUNMOS is to provide high performance message passing and...
Massively parallel computation of discrete logarithms (1993)
Daniel M. Gordon, Kevin S. Mccurley
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size...
Communication on the Paragon (1993)
David Greenberg, Barney Maccabe, Kevin S. Mccurley, Rolf Riesen, Stephen Wheat
In this note we describe the results of some tests of the message-passing performance of the Intel Paragon. These tests have been carried out under both the Intel-supplied OSF/1 operating system with...
Massively Parallel Computation of Discrete Logarithms (1993)
Daniel M. Gordon, Kevin S. Mccurley
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size...
Open Problems in Number Theoretic Complexity, II
Leonard M. Adleman, Kevin S. Mccurley
this paper contains a list of 36 open problems in numbertheoretic complexity. We expect that none of these problems are easy; we are sure that many of them are hard. This list of problems reflects...