Sciweavers

4224 search results - page 795 / 845
» Reasoning about Choice
Sort
View
ICDT
2005
ACM
88views Database» more  ICDT 2005»
14 years 3 months ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
LCTRTS
2005
Springer
14 years 3 months ago
Preventing interrupt overload
Performance guarantees can be given to tasks in an embedded system by ensuring that access to each shared resource is mediated by an appropriate scheduler. However, almost all pre...
John Regehr, Usit Duongsaa
OOPSLA
2005
Springer
14 years 3 months ago
Javari: adding reference immutability to Java
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
Matthew S. Tschantz, Michael D. Ernst
PPDP
2005
Springer
14 years 3 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
SEMWEB
2005
Springer
14 years 3 months ago
Rapid Benchmarking for Semantic Web Knowledge Base Systems
Abstract. We present a method for rapid development of benchmarks for Semantic Web knowledge base systems. At the core, we have a synthetic data generation approach for OWL that is...
Sui-Yu Wang, Yuanbo Guo, Abir Qasem, Jeff Heflin