Sciweavers

2364 search results - page 336 / 473
» An Engine for Computing Well-Founded Models
Sort
View
CGO
2011
IEEE
14 years 8 months ago
Extendable pattern-oriented optimization directives
Abstract—Current programming models and compiler technologies for multi-core processors do not exploit well the performance benefits obtainable by applying algorithm-specific, ...
Huimin Cui, Jingling Xue, Lei Wang, Yang Yang, Xia...
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
16 years 4 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
FSTTCS
2008
Springer
15 years 5 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
ICDCS
2011
IEEE
14 years 4 months ago
Starlink: Runtime Interoperability between Heterogeneous Middleware Protocols
—Interoperability remains a challenging and growing problem within distributed systems. A range of heterogeneous network and middleware protocols which cannot interact with one a...
Yérom-David Bromberg, Paul Grace, Laurent R...
MSWIM
2006
ACM
15 years 10 months ago
Testing methodology for an ad hoc routing protocol
In this paper, we define a model of an ad hoc routing protocol, i.e. the OLSR (Optimized Link-State Routing) protocol. This model handles novel constraints related to such networ...
Stéphane Maag, Fatiha Zaïdi