Sciweavers

1576 search results - page 29 / 316
» Streaming Algorithms for Independent Sets
Sort
View
DASFAA
2007
IEEE
151views Database» more  DASFAA 2007»
15 years 1 months ago
On Label Stream Partition for Efficient Holistic Twig Join
Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme...
Bo Chen, Tok Wang Ling, M. Tamer Özsu, Zhenzh...
CIMCA
2005
IEEE
15 years 3 months ago
Independent Nearest Features Memory-Based Classifier
The classification task is one of the most important problems in the area of data mining. In this paper we propose a new algorithm for addressing this problem. The main idea deriv...
Christos Pateritsas, Andreas Stafylopatis
AAAI
2008
15 years 3 days ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl
PODS
2006
ACM
95views Database» more  PODS 2006»
15 years 10 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
15 years 3 months ago
Better Bounds for Minimizing SONET ADMs
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
Leah Epstein, Asaf Levin