Sciweavers

126 search results - page 19 / 26
» A Framework for Efficient Minimum Distance Computations
Sort
View
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
14 years 1 months ago
Dense and Switched Modular Primitives for Bond Graph Model Design
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
Kisung Seo, Zhun Fan, Jianjun Hu, Erik D. Goodman,...
GRID
2006
Springer
13 years 8 months ago
Metascheduling Multiple Resource Types using the MMKP
Grid computing involves the transparent sharing of computational resources of many types by users across large geographic distances. The altruistic nature of many current grid reso...
Daniel C. Vanderster, Nikitas J. Dimopoulos, Randa...
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 9 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
ETS
2007
IEEE
128views Hardware» more  ETS 2007»
13 years 10 months ago
Selecting Power-Optimal SBST Routines for On-Line Processor Testing
Software-Based Self-Test (SBST) has emerged as an effective strategy for on-line testing of processors integrated in non-safety critical embedded system applications. Among the mo...
Andreas Merentitis, Nektarios Kranitis, Antonis M....
MVA
2008
305views Computer Vision» more  MVA 2008»
13 years 8 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong