Publications
Found 486 results
Author Title [ Type] Year Filters: First Letter Of Last Name is A [Clear All Filters]
FLUX: Content and structure matching of XPath queries with range predicates. DATABASE AND XML TECHNOLOGIES, PROCEEDINGS. 4156:61-76.
.
2006. Fluidic operational amplifier for mock circulatory systems. IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY. 14:602-612.
.
2006. FLUCTUATING HYDRODYNAMICS METHODS FOR DYNAMIC COARSE-GRAINED IMPLICIT-SOLVENT SIMULATIONS IN LAMMPS. SIAM JOURNAL ON SCIENTIFIC COMPUTING. 38:S62-S77.
.
2016. Flexible data cubes for online aggregation. DATABASE THEORY - ICDT 2001, PROCEEDINGS. 1973:159-173.
.
2001. Flexible data cubes for online aggregation. DATABASE THEORY - ICDT 2001, PROCEEDINGS. 1973:159-173.
.
2001. A First-Passage Kinetic Monte Carlo method for reaction drift diffusion processes. JOURNAL OF COMPUTATIONAL PHYSICS. 259:536-567.
.
2014. Feasibility of Outpatient Fully Integrated Closed-Loop Control First studies of wearable artificial pancreas. DIABETES CARE. 36:1851-1858.
.
2013. Feasibility of Outpatient Fully Integrated Closed-Loop Control First studies of wearable artificial pancreas. DIABETES CARE. 36:1851-1858.
.
2013. Feasibility of Long-Term Closed-Loop Control: A Multicenter 6-Month Trial of 24/7 Automated Insulin Delivery. DIABETES TECHNOLOGY & THERAPEUTICS. 19:18-+.
.
2017. Feasibility of Long-Term Closed-Loop Control: A Multicenter 6-Month Trial of 24/7 Automated Insulin Delivery. DIABETES TECHNOLOGY & THERAPEUTICS. 19:18-+.
.
2017. Feasibility conditions for circle criterion designs. SYSTEMS & CONTROL LETTERS. 42:405-412.
.
2001. FATES: Finding a time dEpendent shortest path. MOBILE DATA MANAGEMENT, PROCEEDINGS. 2574:165-180.
.
2003. FATES: Finding a time dEpendent shortest path. MOBILE DATA MANAGEMENT, PROCEEDINGS. 2574:165-180.
.
2003. Fast computation of database operations using content-addressable memories. DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS. 4080:389-398.
.
2006. Fast computation of database operations using content-addressable memories. DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS. 4080:389-398.
.
2006. Exploring spatial datasets with histograms. DISTRIBUTED AND PARALLEL DATABASES. 20:57-88.
.
2006. Exploring spatial datasets with histograms. DISTRIBUTED AND PARALLEL DATABASES. 20:57-88.
.
2006. Exploiting the multi-append-only-trend property of historical data in data warehouses. ADVANCES IN SPATIAL AND TEMPORAL DATABASES, PROCEEDINGS. 2750:179-198.
.
2003. Exploiting the multi-append-only-trend property of historical data in data warehouses. ADVANCES IN SPATIAL AND TEMPORAL DATABASES, PROCEEDINGS. 2750:179-198.
.
2003. Exploiting temporal correlation in temporal data warehouses. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS. 3453:662-674.
.
2005. Exploiting temporal correlation in temporal data warehouses. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS. 3453:662-674.
.
2005. Exploiting sequential access when declustering data over disks and MEMS-based storage. DISTRIBUTED AND PARALLEL DATABASES. 19:147-168.
.
2006. Exploiting sequential access when declustering data over disks and MEMS-based storage. DISTRIBUTED AND PARALLEL DATABASES. 19:147-168.
.
2006. Experimental Verification of the Feasibility of the Cardiovascular Impedance Simulator. IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING. 57:1176-1183.
.
2010. Experimental Verification of the Feasibility of the Cardiovascular Impedance Simulator. IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING. 57:1176-1183.
.
2010.