 IDEALS Home
 →
 College of Engineering
 →
 Dept. of Computer Science
 →
 Browse Dept. of Computer Science by Title
Browse Dept. of Computer Science by Title
Now showing items 886905 of 2584

(20120206)The severity and number of intrusions on computer networks are rapidly increasing. Preserving the availability and integrity of networked computing systems in the face of those fastspreading intrusions requires advances ...
application/pdf
PDF (3MB) 
(20110315)Parametric properties are behavioral properties over program events that depend on one or more parameters. Parameters are bound to concrete data or objects at runtime, which makes parametric properties particularly suitable ...
application/pdf
PDF (1MB) 
(2003)We next apply the above findings towards improving the energy efficiency of generalpurpose processors for realtime multimedia applications. Recently, researchers have proposed two forms of hardware adaptation to improve ...
application/pdf
PDF (7MB) 
(1988)Explanationbased learning (EBL) is a learning method which uses existing knowledge of the domain to construct an explanation for why a specific example is a member of a concept or why a specific combination of actions ...
application/pdf
PDF (11MB) 
application/pdf
PDF (3MB) 
(1992)The research contribution of this dissertation is a formal, computational model of the semantics of negation in natural language; its major components are two knowledge representation formalisms with Boolean semantics: a ...
application/pdf
PDF (10MB) 
(20150428)Online review data contains useful information about consumers’ opinions about the reviewed products. Understanding reviews is extremely important for a producer, such as a corporation designing and producing cell phone, ...
application/pdf
PDF (913kB) 
(20130822)Due to the abundance and rapid growth of opinionated data on the Web, research on opinion mining and summarization techniques has received a lot of attention from industry and academia. Most previous studies on opinion ...
application/pdf
PDF (1MB) 
(200405)We study generalization properties of the area under an ROC curve (AUC), a quantity that has been advocated as an evaluation criterion for bipartite ranking problems. The AUC is a different and more complex term than the ...
application/pdf
PDF (375kB) 
(1989)We study the numerical solution of Hessenberg form differential algebraic equations by variable stepsize generalized backward difference formulae (GBDF). GBDF methods of sufficiently high order are shown to converge for ...
application/pdf
PDF (3MB) 
(200708)Needtoknow is a fundamental security concept: a party should not learn information that is irrelevant to its mission. In this paper we show that during a trust negotiation in which parties show their credentials to one ...
application/pdf
PDF (345kB) 
(2015)This paper presents the generalized packing server. It reduces the problem of scheduling tasks with precedence constraints on multiple processing units to the problem of scheduling independent tasks. The work generalizes ...
application/pdf
PDF (954kB) 
(20120918)As generalpurpose robots begin to find their way into the household and workplace, there will be a demand for software to run on these robots. We foresee the proliferation of robot apps that use a common set of abstractions ...
application/pdf
PDF (584kB) 
(20100831)Smoothed aggregationbased (SA) algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. While SA has been effective over a ...
application/pdf
PDF (4MB) 
(1988)Explanationbased learning is a recently developed approach to concept acquisition by computer. In this type of machine learning, a specific problem's solution is generalized into a form that can later be used to solve ...
application/pdf
PDF (11MB) 
(20100106)This thesis presents a study of a novel summarization problem called contrastive opinion summarization (COS). Given two sets of positively and negatively opinionated sentences which are often the output of an existing ...
application/pdf
PDF (5MB) 
Generating ExpectedTime Efficient Trajectories for Rapidly Finding an Object in Known Environments (2004)In the final version, the robot is no longer a point but a mobile manipulator moving in a 3D environment. The proposed solution builds on previous results and also introduces a samplebased convex cover to estimate the ...
application/pdf
PDF (6MB) 
Generating ExpectedTime Efficient Trajectories for Rapidly Finding an Object in Known Environments (200412)This work addresses the problem of generating a motion strategy for solving a visibilitybased task with a mobile robot equipped with sensors. In particular, the problem is to find a static object  modeled with a probability ...
application/pdf
PDF (2MB) 
application/pdf
PDF (9MB) 
(20090818)High performance, massivelyparallel multiphysics simulations are built on efficient mesh data structures. Most data structures are designed from the bottom up, focusing on the implementation of linear algebra routines. ...
application/pdf
PDF (11MB)
Now showing items 886905 of 2584