Sciweavers

7289 search results - page 1070 / 1458
» A Dependent Set Theory
Sort
View
HPCA
2008
IEEE
16 years 8 months ago
Address-branch correlation: A novel locality for long-latency hard-to-predict branches
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...
Hongliang Gao, Yi Ma, Martin Dimitrov, Huiyang Zho...
POPL
2005
ACM
16 years 8 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
16 years 7 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
EDBT
2008
ACM
151views Database» more  EDBT 2008»
16 years 7 months ago
Fast contextual preference scoring of database tuples
To provide users with only relevant data from the huge amount of available information, personalization systems utilize preferences to allow users to express their interest on spe...
Kostas Stefanidis, Evaggelia Pitoura
ICSE
2008
IEEE-ACM
16 years 7 months ago
Continuous coordination within the context of cooperative and human aspects of software engineering
We have developed software tools that aim to support the cooperative software engineering tasks and promote an awareness of social dependencies that is essential to successful coo...
André van der Hoek, Anita Sarma, Ban Al-Ani...
« Prev « First page 1070 / 1458 Last » Next »