#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2000

2012

- This year (0)
- Last 5 years (0)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Paul R. Cohen, Niall M. Adams, Brent Heeringa
- Intell. Data Anal.
- 2007

We describe a statistical signature of chunks and an algorithm for finding chunks. While there is no formal definition of chunks, they may be reliably identified as configurations with low internalâ€¦ (More)

- Micah Adler, Brent Heeringa
- APPROX-RANDOM
- 2008

- John W. Byers, Brent Heeringa, Michael Mitzenmacher, Georgios Zervas
- ANALCO
- 2011

Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of theâ€¦ (More)

- Michael Gerbush, Brent Heeringa
- CIAA
- 2010

We consider the problem of finding minimum reset sequences in synchronizing automata. The well-known ÄŒernÃ½ conjecture states that every n-state synchronizing automaton has a reset sequence withâ€¦ (More)

- Paul R. Cohen, Brent Heeringa, Niall M. Adams
- Pattern Detection and Discovery
- 2002

This paper describes an unsupervised algorithm for segmenting categorical time series into episodes. The Voting-Experts algorithm first collects statistics about the frequency and boundary entropy ofâ€¦ (More)

- Tim Oates, Brent Heeringa
- ICGI
- 2002

Estimating the parameters of stochastic context-free grammars (SCFGs) from data is an important, well-studied problem. Almost without exception, existing approaches make repeated passes over theâ€¦ (More)

- Marc S. Atkin, Gary W. King, David L. Westbrook, Brent Heeringa, Paul R. Cohen
- Agents
- 2001

The Hierarchical Agent Control Architecture (HAC) is a general toolkit for specifying an agent's behavior. HAC supports action abstraction, resource management, sensor integration, and is well suitedâ€¦ (More)

We propose a novel batch active learning method that leverages the availability of high-quality and efficient sequential active-learning policies by approximating their behavior when applied for kâ€¦ (More)

We give a ln(n) + 1-approximation for the decision tree (DT) problem. We also show that DT does not have a PTAS unless P=NP. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and aâ€¦ (More)

- Paul R. Cohen, Brent Heeringa, Niall M. Adams
- ICDM
- 2002

This paper describes an unsupervised olgorirhm f o r segmenting categorical time series inro episodes. The VOTING-EXPERTS algorithm first collects starisrics about the frequency and boundav entmpy ofâ€¦ (More)