Sciweavers

147 search results - page 10 / 30
» Adaptive methods for netlist partitioning
Sort
View
MICCAI
2007
Springer
15 years 10 months ago
Robust Computation of Mutual Information Using Spatially Adaptive Meshes
Abstract. We present a new method for the fast and robust computation of information theoretic similarity measures for alignment of multi-modality medical images. The proposed meth...
Hari Sundar, Dinggang Shen, George Biros, Chenyang...
AGENTS
1999
Springer
15 years 1 months ago
Team-Partitioned, Opaque-Transition Reinforcement Learning
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-transition reinforcement learning (TPOT-RL). TPOT-RL introduces the concept of usin...
Peter Stone, Manuela M. Veloso
FPL
2004
Springer
83views Hardware» more  FPL 2004»
15 years 3 months ago
System-Level Modeling of Dynamically Reconfigurable Co-processors
Dynamically reconfigurable co-processors (DRCs) are interesting design alternatives when both flexibility and performance are concerns. However, it is difficult to study the perfor...
Yang Qu, Kari Tiensyrjä, Kostas Masselos
VMV
2007
141views Visualization» more  VMV 2007»
14 years 10 months ago
Distance Calculation between a Point and a Subdivision Surface
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
Torsten Ullrich, Volker Settgast, Ulrich Krispel, ...
ICDT
1997
ACM
133views Database» more  ICDT 1997»
15 years 1 months ago
A Formal Foundation for Distributed Workflow Execution Based on State Charts
This paper provides a formal foundation for distributed workfiow executions. The state chart formalism is adapted to the needs of a workflow model in order to establish a basis for...
Dirk Wodtke, Gerhard Weikum