Sciweavers

928 search results - page 119 / 186
» The degree structure of Weihrauch-reducibility
Sort
View
CMSB
2006
Springer
15 years 4 months ago
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
M. Cosentino Lagomarsino, P. Jona, B. Bassetti
IPCO
2008
114views Optimization» more  IPCO 2008»
15 years 2 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi
NAACL
2007
15 years 2 months ago
Incremental Non-Projective Dependency Parsing
An open issue in data-driven dependency parsing is how to handle non-projective dependencies, which seem to be required by linguistically adequate representations, but which pose ...
Joakim Nivre
101
Voted
RIAO
2007
15 years 1 months ago
An Information Retrieval Driven by Ontology: from Query to Document Expansion
The paper proposes an approach to information retrieval based on the use of a structure (ontology) both for document (resp. query) indexing and query evaluating. The conceptual st...
Mustapha Baziz, Mohand Boughanem, Gabriella Pasi, ...
BNCOD
2004
184views Database» more  BNCOD 2004»
15 years 1 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank