Sciweavers

1915 search results - page 77 / 383
» Computing LTS Regression for Large Data Sets
Sort
View
COLING
2002
13 years 9 months ago
Effective Structural Inference for Large XML Documents
This paper investigates methods to automatically infer structural information from large XML documents. Using XML as a reference format, we approach the schema generation problem ...
Jason Sankey, Raymond K. Wong
SOFSEM
2009
Springer
14 years 6 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
P2P
2008
IEEE
120views Communications» more  P2P 2008»
14 years 3 months ago
Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks
Trees are fundamental structures for data dissemination in large-scale network scenarios. However, their inherent fragility has led researchers to rely on more redundant mesh topo...
Davide Frey, Amy L. Murphy
VIIP
2001
13 years 10 months ago
Visual Behavior Characterization for Intrusion Detection in Large Scale Systems
This work focuses on the visual representation of relations towards aiding the exploration and analysis of network intrusions. Fundamentally, the visual representations aid an ana...
Robert F. Erbacher
ECCV
2006
Springer
14 years 11 months ago
Level-Set Curve Particles
In many applications it is necessary to track a moving and deforming boundary on the plane from infrequent, sparse measurements. For instance, each of a set of mobile observers may...
Tingting Jiang, Carlo Tomasi