Hsu, David, Hsu, Murielle, Huang, He, Montgomery, Erwin B.
We present a simple algorithm for detecting oscillatory behavior in discrete data. The data is used as an input driving force acting on a set of simulated damped oscillators. By monitoring the energy...
Hsu, David, Hsu, Murielle, Beggs, John M
No abstract available.
Hsu, David, Tang, Aonan, Hsu, Murielle, Beggs, John M.
A spontaneously active neural system that is capable of continual learning should also be capable of homeostasis of both firing rate and connectivity. Experimental evidence suggests that both types...
HSU, David, LEE, Wee Sun, RONG, Nan
Point-based approximation algorithms have drastically im-proved the speed of POMDP planning. This paper presents a new point-based POMDP algorithm called SARSOP. Like earlier point-based algorithms,...
HSU, David, LEE, Wee Sun, RONG, Nan
Point-based approximation algorithms have drastically im-proved the speed of POMDP planning. This paper presents a new point-based POMDP algorithm called SARSOP. Like earlier point-based algorithms,...
Protein Conformational Flexibility Analysis with Noisy Data (2007)
Protein conformational changes play a critical role in biological functions such as ligand-protein and protein-protein interactions. Due to the noise in structural data, determining salient...
Characterizing Protein Conformation Space (2007)
Nigham, Anshul, Hsu, David, Latombe, Jean-Claude
In this work, we propose a radical approach for exploring the space of all possible protein structures. We present techniques to explore the clash-free conformation space, which comprises all protein...
Characterizing Protein Conformation Space (2007)
Nigham, Anshul, Hsu, David, Latombe, Jean-Claude
In this work, we propose a radical approach for exploring the space of all possible protein structures. We present techniques to explore the clash-free conformation space, which comprises all protein...
Efficient Constrained Delaunay Triangulation for Large Spatial Databases (2006)
WU, Xinyu, HSU, David, TUNG, Anthony K. H.
Delaunay Triangulation (DT) and its extension Constrained Delaunay Triangulation (CDT) are spatial data structures that have wide applications in spatial data processing. Our recent survey shows,...
Adaptive Hybrid Sampling for Probabilistic Roadmap Planning (2004)
Several sophisticated sampling strategies have been proposed recently to address the narrow passage problem for probabilistic roadmap (PRM)planning. They all have unique strengths and weaknesses in...
Field-Programmable Learning Arrays (2003)
Seth Bridges, Miguel Figueroa, David Hsu, Chris Diorio
This paper introduces the Field-Programmable Learning Array, a new paradigm for rapid prototyping of learning primitives and machinelearning algorithms in silicon. The FPLA is a mixed-signal...
Mehmet Serkan, Apaydn Douglas, L. Brutlag, Carlos Guestrin, David Hsu, Jean-claude Latombe, ...
Classic molecular motion simulation techniques, such as Monte Carlo (MC) simulation, generate motion pathways one at a time and spend most of their time in the local minima of the energy landscape...
Mehmet Serkan, Apaydn Douglas, L. Brutlag, Carlos Guestrin, David Hsu, Jean-claude Latombe, ...
Classic molecular motion simulation techniques, such as Monte Carlo (MC) simulation, generate motion pathways one at a time and spend most of their time in the local minima of the energy landscape...
Stochastic Conformational Roadmaps for Computing Ensemble Properties of Molecular Motion (2002)
Mehmet Serkan Apaydn, Douglas L. Brutlag, Carlos Guestrin, David Hsu
A key intuition behind probabilistic roadmap planners for motion planning is that many collision-free paths potentially exist between two given robot configurations. Hence the connectivity of a...
The Bridge Test for Sampling Narrow Passages with Probabilistic Roadmap Planners (2002)
David Hsu, Tingting Jiang, John Reif, Zheng Sun
Probabilistic roadmap (PRM) planners have been successful in path planning of robots with many degrees of freedom, but narrow passages in a robot's configuration space create significant difficulty...
A Mixed-Signal Approach to High-Performance (2002)
Miguel Figueroa, Student Member, David Hsu, Chris Diorio
We present a new approach to the design of high-performance low-power linear filters. We use p-channel synapse transistors as analog memory cells, and mixed-signal circuits for fast low-power...
On Finding Narrow Passages with Probabilistic Roadmap Planners (2002)
This paper provides foundations for understanding the effect of passages on the connectedness of probabilistic roadmaps. It also proposes a new random sampling scheme for finding such passages. An...
David Hsu, Lydia E. Kavrakit, Jean-claude Latombe, Rajeev Motwani
Applications such as robot programming, design for manufactur- ing, animation of digital actors, rationale drug design, and surgical planning, require computing paths in high-dimensional geometric...
Competitive Learning With Floating-Gate Circuits (2002)
David Hsu, Miguel Figueroa, Chris Diorio
Competitive learning is a general technique for training clustering and classification networks. We have developed an 11-transistor silicon circuit, that we term an automaximizing bump circuit, that...
Adaptive CMOS: From Biological Inspiration to (2002)
this paper by first describing synapse transistors because they are the key enabling technology. Fundamentally, they are metal--oxide--semiconductor (MOS) transistors that tune their performance...
Learning Spike-Based Correlations and Conditional Probabilities in Silicon (2002)
Aaron P. Shon, David Hsu, Chris Diorio
We have designed and fabricated a VLSI synapse that can learn a conditional probability or correlation between spike-based inputs and feedback signals. The synapse is low power, compact, provides...
A Silicon Primitive for Competitive Learning (2002)
David Hsu, Miguel Figueroa, Chris Diorio
Competitive learning is a technique for training classification and clustering networks. We have designed and fabricated an 11transistor primitive, that we term an automaximizing bump circuit, that...
Stochastic Roadmap Simulation: An Efficient Representation and (2002)
Mehmet Serkan, Apaydin Douglas, L. Brutlag, Carlos Guestrin, David Hsu, Jean-claude Latombe
Classic techniques for simulating molecular motion, such as the Monte Carlo and molecular dynamics methods, generate individual motion pathways one at a time and spend most of their time trying to...
Randomized Kinodynamic Motion Planning with Moving Obstacles (2001)
David Hsu, Robert Kindel, Jean-claude Latombe, Stephen Rock
This paper presents a novel randomized motion planner for robots that must achieve a specified goal under kinematic and/or dynamic motion constraints while avoiding collision with moving obstacles...
Mehmet Serkan, Apaydin Douglas, L. Brutlag, Carlos Guestrin, David Hsu, Jean-claude Latombe
Classic techniques for simulating molecular motion, such as Monte Carlo method and molecular dynamics, generate individual motion pathways one at a time and are inefficient if applied in a naive...
Placing a Robot Manipulator Amid Obstacles for Optimized Execution (2001)
David Hsu, Jean-claude Latombe, Stephen Sorkin
This paper presents an efficient algorithm for optimizing the base location of a manipulator in an environment cluttered with obstacles, in order to execute specified tasked as fast as possible. The...
with Probabilistic Roadmap Planners (2001)
This paper provides foundations for understanding the effect of passages on the connectedness of probabilistic roadmaps. It also proposes a new random sampling scheme for finding such passages. An...
Self-Calibrating Camera-Projector Systems for Interactive Displays and Presentations (2001)
Rahul Sukthankar, Tat-jen Cham, Gita Sukthankar, Jim Rehg, David Hsu, Thomas Leung
Introduction We demonstrate a self-calibrating system that employs uncalibrated cameras and microportable projectors to create novel interactive displays and presentations. 1 Three benefits of our...
Randomized Kinodynamic Motion Planning with Moving Obstacles (2001)
David Hsu, Robert Kindel, Jean-claude Latombe, Stephen Rock
We present a randomized motion planner for robots that must avoid moving obstacles and achieve a specified goal under kinematic and dynamic constraints. The planner samples the robot's statetime...
A Silicon Primitive for Competitive Learning (2001)
David Hsu, Miguel Figueroa, Chris Diorio
Competitive learning is a technique for training classification and clustering networks. We have designed and fabricated an l 1transistor primitive, that we term an automaximizing bump circuit, that...
David Hsu, Lydia E. Kavraki, Jean-claude Latombe, Rajeev Motwani
. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e#ective approach to solve this problem. In this...
Do Venture Capitalists Affect Commercialization Strategies at Start-ups? (2000)
I empirically study the effect of venture capital (VC) on product development and commercialization strategy of start-up organizations. In doing so, I segment entrant commercialization strategies...
Do Venture Capitalists Affect Commercialization Strategies at Start-ups? (2000)
I empirically study the effect of venture capital (VC) on product development and commercialization strategy of start-up organizations. In doing so, I segment entrant commercialization strategies...
Randomized Single-Query Motion Planning In Expansive Spaces (2000)
Random sampling is a fundamental technique for motion planning of objects with many degrees of freedom (dof). This thesis presents efficient randomized algorithms for singlequery motion planning of...
David Hsu, Lydia E. Kavraki, Jean-claude Latombe, Rajeev Motwani
: Applications such as robot programming, design for manufacturing, animation of digital actors, rationale drug design, and surgical planning, require computing paths in high-dimensional geometric...
Randomized Kinodynamic Motion Planning with Moving Obstacles (2000)
This paper shows that the probability that the planner fails to find a trajectory when one exists quickly goes to 0 as the number of milestones grows. The planner has been tested successfully in both...
Kinodynamic Motion Planning Amidst Moving Obstacles (2000)
Robert Kindel, David Hsu, Jean-claude Latombe, Stephen Rock
This paper presents a randomized motion planner for kinodynamic asteroid avoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic constraints and reach...
A Hierarchical Method for Real-Time Distance Computation among Moving Convex Bodies (2000)
Lenoidas J. Guibas, David Hsu, Li Zhang
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical representations. For...
Randomized single-query motion planning in expansive spaces / (2000)
Submitted to the Department of Computer Science.
On Finding Narrow Passages with Probabilistic Roadmap Planners (1999)
This paper provides foundations for understanding the effect of passages on the connectedness of probabilistic roadmaps. It also proposes a new random sampling scheme for finding such passages. An...
Kinodynamic Motion Planning Amidst Moving Obstacles (1999)
Robert Kindel, David Hsu, Jean-claude Latombe, Stephen Rock
This paper presents a randomized motion planner for kinodynamic asteroid avoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic and dynamic constraints....
A Hierarchical Method for Real-Time Distance Computation among Moving Convex Bodies (1999)
Lenoidas J. Guibas, David Hsu, Li Zhang
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical representations. For...
A Hierarchical Method for Real-Time Distance Computation among Moving Convex Bodies (1999)
Lenoidas J. Guibas, David Hsu, Li Zhang
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical representations. For...
Leonidas J. Guibas, David Hsu, Li Zhang
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical representations. For...
Placing a Robot Manipulator Amid Obstacles for Optimized Execution (1999)
David Hsu, Jean-claude Latombe, Stephen Sorkin
This paper presents an efficient algorithm for optimizing the base location of a robot manipulator in an environment cluttered with obstacles, in order to execute specified tasks as fast as possible....
Kinodynamic Motion Planning Amidst Moving Obstacles (1999)
Robert Kindel, David Hsu, Jean-claude Latombe, Stephen Rock
This paper presents a randomized motion planner for kinodynamic asteroid avoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic and dynamic constraints....
Computing the Largest Inscribed Isothetic Rectangle (1999)
this paper, we give a logarithmic-time solution to a problem considered by Fischer and Hoffgen [2]: Given the list vertices of a convex polygon P in counterclockwise (ccw) order, stored in an array...
H-Walk: Hierarchical Distance Computation for Moving Convex Bodies (1999)
Leonidas J. Guibas, David Hsu, Li Zhang
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical representations. For...
H-Walk : Hierarchical Distance Computation for Moving Convex Bodies (1999)
Leonidas J. Guibas, David Hsu, Li Zhang
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical representations. For...
Exploring Common Conceptions About Boys and Electronic Games (1999)
Joan Lawry, Rena Upitis, Maria Klawe, Ann Anderson, Kori Inkpen, Mutindi Ndunda, ...
Electronic games are an integral part of many boys' lives. Based on observations made over a two-month period at an electronic games exhibit in an interactive science museum in Vancouver, Canada, we...
Rena Upitis, Richard Dearden, Kori Inkpen, Joan Lawry, Maria Klawe, Kelly Davidson, ...
d achievement in mathematics and the basic and applied sciences (Serbin, Zelkowitz, Doyle, & Gold, 1990; Smith & Schroeder, 1981; Tracy, 1990). Despite the considerable attention received by the...
"We Have Never-Forgetful Flowers In Our Garden:" Girls' Responses To Electronic Games (1999)
Kori Inkpen, Rena Upitis, Maria Klawe, Joan Lawry, Ann Anderson, Mutindi Ndunda, ...
Electronic Games for Education in Math and Science (E-GEMS) is a large-scale research project designed to increase the proportion of children who enjoy learning and mastering mathematical concepts...
Placing a Robot Manipulator Amid Obstacles for Optimized Execution (1998)
David Hsu, Jean-claude Latombe, Stephen Sorkin
This paper presents an efficient algorithm for optimizing the base location of a manipulator in an environment cluttered with obstacles, in order to execute specified tasked as fast as possible. The...
Placing a Robot Manipulator Amid Obstacles for Optimized Execution (1998)
David Hsu, Jean-claude Latombe, Stephen Sorkin
This paper presents an efficient algorithm for optimizing the base location of a manipulator in an environment cluttered with obstacles, in order to execute specified tasked as fast as possible. The...
Placing a Robot Manipulator Amid Obstacles for Optimized Execution (1998)
David Hsu, Jean-claude Latombe, Stephen Sorkin
This paper presents an efficient algorithm for optimizing the base location of a manipulator in an environment cluttered with obstacles, in order to execute specified tasked as fast as possible. The...
Placing a Robot Manipulator Amid Obstacles for Optimized Execution (1998)
David Hsu, Jean-claude Latombe, Stephen Sorkin
This paper presents an efficient algorithm for optimizing the base location of a manipulator in an environment cluttered with obstacles, in order to execute specified tasked as fast as possible. The...
Path Planning In Expansive Configuration Spaces (1998)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomlysampled milestones. The analysis...
Path Planning In Expansive Configuration Spaces (1998)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomlysampled milestones. The analysis...
Path Planning In Expansive Configuration Spaces (1998)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomlysampled milestones. The analysis...
Path Planning In Expansive Configuration Spaces (1998)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomlysampled milestones. The analysis...
Path Planning in Expansive Configuration Spaces (1998)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomly-sampled milestones. The...
Path Planning in Expansive Configuration Spaces (1998)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomly-sampled milestones. The...
Path Planning in Expansive Configuration Spaces (1998)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomly-sampled milestones. The...
Path Planning in Expansive Configuration Spaces (1998)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomly-sampled milestones. The...
David Hsu, Lydia E. Kavraki, Jean-claude Latombe, Rajeev Motwani
: Applications such as robot programming, design for manufacturing, animation of digital actors, rationale drug design, and surgical planning, require computing paths in high-dimensional geometric...
On Finding Narrow Passages with Probabilistic Roadmap Planners (1998)
This paper provides foundations for understanding the effect of passages on the connectedness of probabilistic roadmaps. It also proposes a new random sampling scheme for finding such passages. An...
Exploring Common Conceptions About Boys and Electronic Games (1998)
Joan Lawry, Rena Upitis, Maria Klawe, Ann Anderson, Kori Inkpen, Mutindi Ndunda, ...
Electronic games are an integral part of many boys' lives. Based on observations made over a two-month period at an electronic games exhibit in an interactive science museum in Vancouver, Canada, we...
"We Have Never-Forgetful Flowers In Our Garden:" Girls' Responses To Electronic Games (1998)
Kori Inkpen, Rena Upitis, Maria Klawe, Joan Lawry, Ann Anderson, Mutindi Ndunda, ...
Electronic Games for Education in Math and Science (E-GEMS) is a large-scale research project designed to increase the proportion of children who enjoy learning and mastering mathematical concepts...
Exploring Common Conceptions About Boys and Electronic Games (1997)
Joan Lawry, Rena Upitis, Maria Klawe, Ann Anderson, Kori Inkpen, Mutindi Ndunda, ...
Electronic games are an integral part of many boys' lives. Based on observations made over a two-month period at an electronic games exhibit in an interactive science museum in Vancouver, Canada, we...
Rena Upitis, Richard Dearden, Kori Inkpen, Joan Lawry, Maria Klawe, Kelly Davidson, ...
d achievement in mathematics and the basic and applied sciences (Serbin, Zelkowitz, Doyle, & Gold, 1990; Smith & Schroeder, 1981; Tracy, 1990). Despite the considerable attention received by the...
Exploring Common Conceptions About Boys and Electronic Games (1997)
Joan Lawry, Rena Upitis, Maria Klawe, Ann Anderson, Kori Inkpen, Mutindi Ndunda, ...
Electronic games are an integral part of many boys' lives. Based on observations made over a two-month period at an electronic games exhibit in an interactive science museum in Vancouver, Canada, we...
"We Have Never-Forgetful Flowers In Our Garden:" Girls' Responses To Electronic Games (1997)
Kori Inkpen, Rena Upitis, Maria Klawe, Joan Lawry, Ann Anderson, Mutindi Ndunda, ...
Electronic Games for Education in Math and Science (E-GEMS) is a large-scale research project designed to increase the proportion of children who enjoy learning and mastering mathematical concepts...
Path Planning in Expansive Configuration Spaces (1997)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomly-sampled milestones. The...
Path Planning in Expansive Configuration Spaces (1997)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomly-sampled milestones. The...
Path Planning in Expansive Configuration Spaces (1997)
David Hsu, Jean-claude Latombe, Rajeev Motwani
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomly-sampled milestones. The...