Sciweavers

1429 search results - page 285 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
14 years 11 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
DAC
2008
ACM
14 years 11 months ago
DeMOR: decentralized model order reduction of linear networks with massive ports
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie C...
EUSFLAT
2007
156views Fuzzy Logic» more  EUSFLAT 2007»
14 years 11 months ago
Fuzzy Calculating and Fuzzy Control in Wireless Sensor Network
At present time configurable wireless sensor networks are given special consideration. Wireless sensor networks are now a static elements union. To make such a network a powerful ...
Irina Kalganova
ACL
2006
14 years 11 months ago
Morphological Richness Offsets Resource Demand - Experiences in Constructing a POS Tagger for Hindi
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
Smriti Singh, Kuhoo Gupta, Manish Shrivastava, Pus...
BMCBI
2010
178views more  BMCBI 2010»
14 years 9 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...