Search
Now showing items 1-10 of 40
Mining Posets from Linear Orders
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2009), TR-09-16
There has been much research on the combinatorial problem of generating the linear extensions of a given poset. This paper focuses on the reverse of that problem, where the input is a set of linear orders, and the goal is ...
Modeling the Goodput of TCP NewReno in Cellular Environments
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2007), TR-07-41
In this paper, we present an analytical model that characterizes TCP NewReno's goodput as a function of round-trip time, average time duration between handoffs, average number of packets reordered during a handoff, and the ...
On Locally Linear Classification by Pairwise Coupling
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2008), TR-08-20
Locally linear classification by pairwise coupling addresses a nonlinear classification problem by three basic phases: decompose the classes of complex concepts into linearly separable subclasses, learn a linear classifier ...
The Poset Cover Problem
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2012), TR-12-17
A partial order or poset P = (X,<) on a (finite) base set X determines the set L(P) of linear extensions of P. The problem of computing, for a poset P, the cardinality of L(P) is #P-complete. A set {P1, P2, . . . , Pk} of ...
An Adaptive Noise Filtering Algorithm for AVIRIS Data with Implications for Classification Accuracy
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2008), TR-08-15
This paper describes a new algorithm used to adaptively filter a remote sensing dataset based on signal-to-noise ratios (SNRs) once the maximum noise fraction (MNF) has been applied. This algorithm uses Hermite splines to ...
A Workload-Aware, Eco-Friendly Daemon for Cluster Computing
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2008), TR-08-25
This paper presents an eco-friendly daemon that reduces power consumption while better maintaining high performance via a novel behavioral quantification of workload. Specifically, our behavioral quantification achieves ...
Feature Reduction using a Singular Value Decomposition for the Iterative Guided Spectral Class Rejection Hybrid Classifier
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2007), TR-07-17
Feature reduction in a remote sensing dataset is often desirable to decrease the processing time required to perform a classification and improve overall classification accuracy. This work introduces a feature reduction ...
Science of Digital Libraries(SciDL)
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2003), TR-03-13
Our purpose is to ensure that people and institutions better manage information through digital libraries (DLs). Thus we address a fundamental human and social need, which is particularly urgent in the modern Information ...
Dynamic Data Structures for a Direct Search Algorithm
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2001), TR-01-09
The DIRECT (DIviding RECTangles) algorithm of Jones, Perttunen, and Stuckman (1993), a variant of Lipschitzian methods for bound constrained global optimization, has proved effective even in higher dimensions. However, the ...
Clustering for Data Reduction: A Divide and Conquer Approach
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2007-10-01), TR-07-36
We consider the problem of reducing a potentially very large dataset to a subset of representative prototypes. Rather than searching over the entire space of prototypes, we first roughly divide the data into balanced ...