Sciweavers

5055 search results - page 73 / 1011
» Relative Timing
Sort
View
117
Voted
FOCS
2008
IEEE
15 years 9 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
123
Voted
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
15 years 8 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
DAGSTUHL
2006
15 years 3 months ago
Hierarchies Relating Topology and Geometry
Cognitive Vision has to represent, reason and learn about objects in its environment it has to manipulate and react to. There are deformable objects like humans which cannot be des...
Walter G. Kropatsch, Yll Haxhimusa, Pascal Lienhar...
138
Voted
JCO
2010
99views more  JCO 2010»
15 years 29 days ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 9 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...