Sciweavers

651 search results - page 35 / 131
» Index Sets and Universal Numberings
Sort
View
CSJM
2007
60views more  CSJM 2007»
13 years 9 months ago
An edge colouring of multigraphs
We consider a strict k-colouring of a multigraph G as a surjection f from the vertex set of G into a set of colours {1,2,. . . ,k} such that, for every non-pendant vertex x of G, ...
Mario Gionfriddo, Alberto Amato
CSL
2007
Springer
14 years 3 months ago
Classical Program Extraction in the Calculus of Constructions
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
Alexandre Miquel
IDEAS
2007
IEEE
135views Database» more  IDEAS 2007»
14 years 3 months ago
Bitmap Index Design Choices and Their Performance Implications
Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of t...
Elizabeth J. O'Neil, Patrick E. O'Neil, Kesheng Wu
ICDT
2005
ACM
88views Database» more  ICDT 2005»
14 years 2 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
ICSE
1997
IEEE-ACM
14 years 1 months ago
Prioritizing Software Requirements in an Industrial Setting
The planning of additional featuresand releases is a major concem for commercialsoftware companies. We describe how, in collaboration with Ericsson Radio Systems, we developed and...
Kevin Ryan, Joachim Karlsson