Sciweavers

236 search results - page 4 / 48
» join 2006
Sort
View
AOSD
2006
ACM
14 years 12 days ago
A join point for loops in AspectJ
The current AspectJ join points represent locations in the code that are at the interface of the Java objects. However, not all the “things that happen”1 happen at the interfa...
Bruno Harbulot, John R. Gurd
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
14 years 6 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
COMBINATORICS
2000
61views more  COMBINATORICS 2000»
13 years 6 months ago
Where the Typical Set Partitions Meet and Join
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...
Boris Pittel
JUCS
2006
87views more  JUCS 2006»
13 years 6 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
JAIR
2010
130views more  JAIR 2010»
13 years 4 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...