Sciweavers

10054 search results - page 1764 / 2011
» On the Complexity of Function Learning
Sort
View
DEBU
2008
118views more  DEBU 2008»
15 years 4 months ago
Big, Fast XQuery: Enabling Content Applications
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...
Mary Holstege
ENTCS
2010
133views more  ENTCS 2010»
15 years 4 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness
ALMOB
2006
80views more  ALMOB 2006»
15 years 4 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
AO
2006
128views more  AO 2006»
15 years 4 months ago
Towards ontologies for formalizing modularization and communication in large software systems
Large software systems are modularized in order to improve manageability. The parts of the software system communicate in order to achieve the desired functionality. To better und...
Daniel Oberle, Steffen Lamparter, Stephan Grimm, D...
FGCS
2008
102views more  FGCS 2008»
15 years 4 months ago
Making the best of a bad situation: Prioritized storage management in GEMS
As distributed storage systems grow, the response time between detection and repair of the error becomes significant. Systems built on shared servers have additional complexity be...
Justin M. Wozniak, Paul Brenner, Douglas Thain, Aa...
« Prev « First page 1764 / 2011 Last » Next »