Sciweavers

36 search results - page 2 / 8
» Integrating TPNs and Performance Bound Techniques in ITPN-Pe...
Sort
View
DAC
2003
ACM
14 years 6 months ago
A new enhanced constructive decomposition and mapping algorithm
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
Alan Mishchenko, Xinning Wang, Timothy Kam
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 2 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
IPPS
2008
IEEE
13 years 11 months ago
Supporting high performance bioinformatics flat-file data processing using indices
As an essential part of in vitro analysis, biological database query has become more and more important in the research process. A few challenges that are specific to bioinformat...
Xuan Zhang, Gagan Agrawal
JMLR
2008
129views more  JMLR 2008»
13 years 5 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
SIAMCO
2010
169views more  SIAMCO 2010»
13 years 1 days ago
Shape Derivative of Drag Functional
Abstract. In the paper compressible, stationary Navier-Stokes (N-S) equations are considered. The model is well-posed, there exist weak solutions in bounded domains, subject to inh...
Pavel I. Plotnikov, Jan Sokolowski