Sciweavers

2841 search results - page 462 / 569
» A Call to Order
Sort
View
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
13 years 9 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
VLDB
2005
ACM
152views Database» more  VLDB 2005»
16 years 6 months ago
Composing, optimizing, and executing plans for bioinformatics web services
The emergence of a large number of bioinformatics datasets on the Internet has resulted in the need for flexible and efficient approaches to integrate information from multiple bio...
Snehal Thakkar, José Luis Ambite, Craig A. Knoblo...
ESOP
2005
Springer
16 years 1 days ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow
TSE
1998
83views more  TSE 1998»
15 years 6 months ago
Cost-Effective Analysis of In-Place Software Processes
—Process studies and improvement efforts typically call for new instrumentation on the process in order to collect the data they have deemed necessary. This can be intrusive and ...
Jonathan E. Cook, Lawrence G. Votta, Alexander L. ...
IROS
2008
IEEE
108views Robotics» more  IROS 2008»
16 years 28 days ago
A random set formulation for Bayesian SLAM
—This paper presents an alternative formulation for the Bayesian feature-based simultaneous localisation and mapping (SLAM) problem, using a random finite set approach. For a fe...
John Mullane, Ba-Ngu Vo, Martin David Adams, Wijer...