Sciweavers

522 search results - page 102 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
IJRR
2010
113views more  IJRR 2010»
13 years 6 months ago
On the Topology of Discrete Strategies
This paper explores a topological perspective of planning in the presence of uncertainty, focusing on tasks specified by goal states in discrete spaces. The paper introduces stra...
Michael Erdmann
SIGMOD
2010
ACM
208views Database» more  SIGMOD 2010»
13 years 6 months ago
An automated, yet interactive and portable DB designer
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...
Ioannis Alagiannis, Debabrata Dash, Karl Schnaitte...
STVR
2010
99views more  STVR 2010»
13 years 6 months ago
Fault localization based on information flow coverage
Failures triggered by hard to debug defects usually involve complex interactions between many program elements. We hypothesize that information flows present a good model for such ...
Wes Masri
TSD
2010
Springer
13 years 6 months ago
Evaluation of a Sentence Ranker for Text Summarization Based on Roget's Thesaurus
Abstract. Evaluation is one of the hardest tasks in automatic text summarization. It is perhaps even harder to determine how much a particular component of a summarization system c...
Alistair Kennedy, Stan Szpakowicz
IMC
2010
ACM
13 years 5 months ago
Speed testing without speed tests: estimating achievable download speed from passive measurements
How fast is the network? The speed at which real users can download content at different locations and at different times is an important metric for service providers. Knowledge o...
Alexandre Gerber, Jeffrey Pang, Oliver Spatscheck,...