 IDEALS Home
 →
 College of Engineering
 →
 Dept. of Computer Science
 →
 Research and Tech Reports  Computer Science
 →
 Browse Research and Tech Reports  Computer Science by Subject
Browse Research and Tech Reports  Computer Science by Subject "algorithms"
Now showing items 524 of 27

(200902)Many questions about homotopy are provably hard or even unsolvable in general. However, in specific settings, it is possible to efficiently test homotopyequivalence or compute shortest cycles with prescribed homotopy. We ...
application/pdf
PDF (1MB) 
(200412)A generalized predictive analysis technique is proposed for detecting violations of safety properties from apparently successful executions of multithreaded programs. Specifically, we provide an algorithm to monitor ...
application/pdf
PDF (208kB) 
(200802)This research presents a novel method for learning the lexical semantics of action verbs. The primary focus is on actions that are directed towards objects, such as kicking a ball or pushing a chair. Specifically, this ...
application/pdf
PDF (2MB) 
(200508)By adding the complement operator (\neg), extended regular expressions ({\ERE}) can encode regular languages nonelementarily more succinctly than regular expressions. The {\ERE} membership problem asks whether a word w ...
application/pdf
PDF (228kB) 
(200606)During the past decade, due to rapidly growing computational power, complicated numerical algorithms have become popular in graphics community which greatly improved the quality of graphics imagery. On the other hand, to ...
application/pdf
PDF (26MB) 
(200708)Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. The projection vectors are commonly obtained by maximizing the between class covariance and simultaneously ...
application/pdf
PDF (197kB) 
(200705)Solving partial differential equations (PDEs) using analytical techniques is intractable for all but the simplest problems. Many computational approaches to approximate solutions to PDEs yield large systems of linear ...
application/pdf
PDF (4MB) 
(200511)We present new algorithms for learning a logical model of actions' effects and preconditions in partially observable domains. The algorithms maintain a logical representation of the set of possible action models after each ...
application/pdf
PDF (197kB) 
(200508)We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessary for checking a CTL formula instead of ...
application/pdf
PDF (232kB) 
(200604)Most of the existing learning algorithms take vectors as their input data. A function is then learned in such a vector space for classification, clustering, or dimensionality reduction. However, in some situations, there ...
application/pdf
PDF (185kB) 
(200505)Filtering denotes any method whereby an agent updates its belief state  its knowledge of the state of the world  from a sequence of actions and observations. In logical filtering, the belief state is a logical formula ...
application/pdf
PDF (325kB) 
(200603)Resource reclaiming schemes are applied in reservationbased realtime uniprocessor systems to support efficient reclaiming and sharing of computational resources left unused by early completing tasks, improving the response ...
application/pdf
PDF (202kB) 
(200312)We develop an approach for automatically learning the optimal feature transformation for a given classification problem. The approach is based on extending the principle of risk minimization (RM), commonly used for learning ...
application/pdf
PDF (243kB) 
(200807)As Internet telephony systems continue to replace existing Public Switched Telephone Network systems, proxy servers running the Session Initiation Protocol (SIP) will continue to grow in importance for VoiceoverIP ...
application/pdf
PDF (102kB) 
(200505)We study random number generation using a biased source motivated by previous works on this topic, mainly, von Neumman (1951), Elias (1972), Knuth and Yao (1976) and Peres (1992). We study the problem in two cases: first, ...
application/pdf
PDF (500kB) 
(200508)Kinodynamic and nonholonomic planning problems have differential constraints which restrict admissible velocities and accelerations of robotic systems. Since these differential constraints are ignored in the path planning ...
application/pdf
PDF (2MB) 
(200607)We present algorithms and hardness results for three resource allocation problems. The first is an abstract admission control problem where the system receives a series of requests and wants to satisfy as many as possible, ...
application/pdf
PDF (498kB) 
(200705)Spectral methods have recently emerged as a powerful tool for dimensionality reduction and manifold learning. These methods use information contained in the eigenvectors of a data affinity (\ie, itemitem similarity) matrix ...
application/pdf
PDF (273kB) 
(200705)Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. The projection functions of LDA are commonly obtained by maximizing the between class covariance and ...
application/pdf
PDF (249kB) 
(200506)Energy efficient routing is a critical problem in multihop wireless networks due to the severe power constraint of wireless nodes. Despite its importance and many research efforts towards it, a distributed routing algorithm ...
application/pdf
PDF (159kB)
Now showing items 524 of 27