Sciweavers

40 search results - page 5 / 8
» nc 2010
Sort
View
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 4 months ago
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
Eric Goles Chacc, Bruno Martin
SIAMNUM
2010
103views more  SIAMNUM 2010»
13 years 1 months ago
Hybridization and Postprocessing Techniques for Mixed Eigenfunctions
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...
Bernardo Cockburn, Jayadeep Gopalakrishnan, F. Li,...
IAJIT
2010
107views more  IAJIT 2010»
13 years 4 months ago
Low Latency, High Throughput, and Less Complex VLSI Architecture for 2D-DFT
: This paper proposes a pipelined, systolic architecture for two- dimensional discrete Fourier transform computation which is highly concurrent. The architecture consists of two, o...
Sohil Shah, Preethi Venkatesan, Deepa Sundar, Muni...
MCS
2010
Springer
13 years 11 months ago
Incremental Learning of New Classes in Unbalanced Datasets: Learn + + .UDNC
We have previously described an incremental learning algorithm, Learn++ .NC, for learning from new datasets that may include new concept classes without accessing previously seen d...
Gregory Ditzler, Michael D. Muhlbaier, Robi Polika...
NC
2010
137views Neural Networks» more  NC 2010»
13 years 1 months ago
On the regularity of circular splicing languages: a survey and new developments
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focu...
Paola Bonizzoni, Clelia de Felice, Gabriele Fici, ...