903 search results - page 36 / 181 » On the reduction of a random basis |
84
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...
118
click to vote
DATE
2010
IEEE
15 years 7 months ago
2010
IEEE
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...
107
click to vote
JFP
2008
15 years 1 months ago
2008
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
118
click to vote
AMI
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. High average intensity of traffic and problems like traffic congestions, road safety, etc. are challenging problems striking highway operators in these days. With the bro...
163
click to vote
BMCBI
2011
14 years 5 months ago
2011
Background: Discovering the genetic basis of common genetic diseases in the human genome represents a public health issue. However, the dimensionality of the genetic data (up to 1...