Sciweavers

JCSS
2007
68views more  JCSS 2007»
13 years 11 months ago
Portfolio and investment risk analysis on global grids
The financial services industry today produces and consumes huge amounts of data and the processes involved in analysing these data are equally huge especially in terms of their c...
Rafael Moreno-Vozmediano, Krishna Nadiminti, Sriku...
JCSS
2007
77views more  JCSS 2007»
13 years 11 months ago
A new approach to model virtual channels in interconnection networks
In this paper we present a new approach to model the effect of virtual channel multiplexing in high-speed interconnection networks. Previous studies have used a method proposed by...
Nasser Alzeidi, Ahmad Khonsari, Mohamed Ould-Khaou...
JCSS
2007
116views more  JCSS 2007»
13 years 11 months ago
The most probable annotation problem in HMMs and its application to bioinformatics
Hidden Markov models (HMMs) are often used for biological sequence annotation. Each sequence feature is represented by a collection of states with the same label. In annotating a ...
Brona Brejová, Daniel G. Brown 0001, Tom&aa...
JCSS
2007
89views more  JCSS 2007»
13 years 11 months ago
The relative worst-order ratio applied to paging
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen
JCSS
2007
85views more  JCSS 2007»
13 years 11 months ago
A general dimension for query learning
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
José L. Balcázar, Jorge Castro, Davi...
JCSS
2007
88views more  JCSS 2007»
13 years 11 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...
Denis Xavier Charles
JCSS
2007
66views more  JCSS 2007»
13 years 11 months ago
Individual communication complexity
Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshch...
JCSS
2007
75views more  JCSS 2007»
13 years 11 months ago
Undecidability of the structure of the Solovay degrees of c.e. reals
We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.
Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey L...
JCSS
2007
107views more  JCSS 2007»
13 years 11 months ago
On the minimization of XML Schemas and tree automata for unranked trees
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
Wim Martens, Joachim Niehren