Sciweavers

801 search results - page 79 / 161
» Minimal Locked Trees
Sort
View
JAIR
2008
120views more  JAIR 2008»
15 years 6 months ago
Anytime Induction of Low-cost, Low-error Classifiers: a Sampling-based Approach
Machine learning techniques are gaining prevalence in the production of a wide range of classifiers for complex real-world applications with nonuniform testing and misclassificati...
Saher Esmeir, Shaul Markovitch
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 8 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
ICCAD
1999
IEEE
93views Hardware» more  ICCAD 1999»
15 years 10 months ago
LEOPARD: a Logical Effort-based fanout OPtimizer for ARea and Delay
We present LEOPARD, a fanout optimization algorithm based on the effort delay model for near-continuous size buffer libraries. Our algorithm minimizes area under required timing a...
Peyman Rezvani, Amir H. Ajami, Massoud Pedram, Ham...
GCB
1997
Springer
74views Biometrics» more  GCB 1997»
15 years 10 months ago
Using constraint programming for lattice protein folding
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
Rolf Backofen
ISBI
2009
IEEE
16 years 1 months ago
A New Interactive Method for Coronary Arteries Segmentation Based on Tubular Anisotropy
In this paper we present a new interactive method for tubular structure extraction. The main application and motivation for this work is vessel tracking in 3D medical images. The ...
Fethallah Benmansour, Laurent D. Cohen