Sciweavers

522 search results - page 28 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
SIGIR
2008
ACM
13 years 7 months ago
Generalising multiple capture-recapture to non-uniform sample sizes
Algorithms in distributed information retrieval often rely on accurate knowledge of the size of a collection. The "multiple capture-recapture" method of Shokouhi et al. ...
Paul Thomas
JAL
2007
95views more  JAL 2007»
13 years 7 months ago
Computing shortest paths with uncertainty
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
Tomás Feder, Rajeev Motwani, Liadan O'Calla...
TON
1998
63views more  TON 1998»
13 years 7 months ago
On variations of queue response for inputs with the same mean and autocorrelation function
— This paper explores the variations in mean queue length for stationary arrival processes with the same mean and autocorrelation functions, or equivalently, the same mean and po...
Bruce Hajek, Linhai He
ICRA
2010
IEEE
118views Robotics» more  ICRA 2010»
13 years 6 months ago
Tactile object class and internal state recognition for mobile manipulation
— Tactile information is valuable in determining properties of objects that are inaccessible from visual perception. In this work, we present a tactile perception strategy that a...
Sachin Chitta, Matthew Piccoli, Jürgen Sturm
ISOLA
2010
Springer
13 years 6 months ago
Worst-Case Analysis of Heap Allocations
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
Wolfgang Puffitsch, Benedikt Huber, Martin Schoebe...