#### Filter Results:

#### Publication Year

1987

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper examines the compression beneets that can be obtained by reordering the bands of a multispectral image. In particular, we consider a model of lossless image compression in which each band of a multispectral image is coded using a prediction function involving values from a previously coded band of the compression. Clearly, the ordering of the… (More)

Searching for a goal is a central and extensively studied problem in computer science. In classical searching problems, the cost of a search function is simply the number of queries made to an oracle that knows the position of the goal. In many robotics problems, as well as in problems from other areas, we want to charge a cost proportional to the distance… (More)

A Threshold Circuit consists of an acyclic digraph of unbounded fanin, where each node computes a threshold function or its negation. This paper investigates the computational power of Threshold Circuits. A surprising relationship is uncovered between Threshold Circuits and another class of unbounded fanin circuits which are denoted Finite Field Z P (n)… (More)

Intrusion Detection Systems (IDS) are responsible for monitoring and analyzing host or network activity to detect intrusions in order to protect information from unauthorized access or manipulation. There are two main approaches for intrusion detection: signature-based and anomaly-based. Signature-based detection employs pattern matching to match attack… (More)

—We consider the problem of keeping sensitive data and algorithms contained in a mobile agent from discovery and exploitation by a malicious host. The focus in this paper is on rigorous techniques based on cryptographic protocols. Algesheimer, Cachin, Camenisch, and Karjoth (IEEE Security and Privacy, 2001) devised a secure agent protocol in such a setting,… (More)

Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits (of bounded fan-in) for integer division (finding reciprocals) that have size <italic>&Ogr;</italic>(<italic>M</italic>(<italic>n</italic>)) and depth <italic>&Ogr;</italic>(log<italic>n</italic>log log<italic>n</italic>), where… (More)

The n-body simulation problem is stated as follows: Given initial positions and velocities of n particles that have pair-wise force interactions, simulate the movement of these particles so as to determine the positions of the particles at a future time. In this paper, we give the rst known n-body simulation algorithms with rigorous proofs of bounded error.… (More)

- P W Vik, P Carrello, S R Tate, C Field
- Psychology of addictive behaviors : journal of…
- 2000

Among a sample of 180 male and 226 female undergraduates, 84.2% reported a heavy drinking episode (5+ drinks for men, 4+ for women) within the previous 90 days. Principal-components analysis revealed 3 alcohol-related problem factors among the heavy drinkers (Careless Behavior, Risky/Reckless Behavior, and Authority Problems). Nearly all heavy drinkers… (More)

In this paper, we examine the problem of incrementally evaluating algebraic functions. In particular, if f(x 1 , x 2 , …, x n) = (y 1 , y 2 , …, y m) is an algebraic problem, we consider answering on-line requests of the form ―change input x i to value v'' or ―what is the value of output y j ?'' We first present lower bounds for some simply stated algebraic… (More)

Direct anonymous attestation (DAA) is an anonymous au-thentication scheme adopted by the Trusted Computing Group in its specifications for trusted computing platforms. This paper presents an efficient construction that implements all anonymous authentication features specified in DAA, including authentication with total anonymity, authentication with… (More)