Sciweavers

2693 search results - page 37 / 539
» French Order Without Order
Sort
View
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 10 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
AIPS
2007
13 years 11 months ago
Prioritizing Bellman Backups without a Priority Queue
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
Peng Dai, Eric A. Hansen
ECAI
1992
Springer
14 years 26 days ago
Shift of Bias without Operators
Just as the order defined by generality over concepts allows concept induction to be performed without generalisation/specialisation operators, so too the order defined by set inc...
Claudio Carpineto
ICDE
2011
IEEE
224views Database» more  ICDE 2011»
13 years 7 days ago
SmartTrace: Finding similar trajectories in smartphone networks without disclosing the traces
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
Costandinos Costa, Christos Laoudias, Demetrios Ze...
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 8 months ago
Note on edge-colored graphs and digraphs without properly colored cycles
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
Gregory Gutin