Sciweavers

1184 search results - page 178 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
CVPR
2009
IEEE
16 years 9 months ago
A Min-Max Framework of Cascaded Classifier with Multiple Instance Learning for Computer Aided Diagnosis
The computer aided diagnosis (CAD) problems of detecting potentially diseased structures from medical images are typically distinguished by the following challenging characterist...
Dijia Wu (Rensselaer Polytechnic Institute), Jinbo...
GIS
2006
ACM
16 years 3 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
TAMC
2009
Springer
15 years 6 months ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo
BROADNETS
2007
IEEE
15 years 8 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
ICCAD
2008
IEEE
115views Hardware» more  ICCAD 2008»
15 years 10 months ago
Minimizing the energy cost of throughput in a linear pipeline by opportunistic time borrowing
- In this paper, we present a technique to optimize the energy-delay product of a synchronous linear pipeline circuit with dynamic error detection and correction capability running...
Mohammad Ghasemazar, Massoud Pedram