Sciweavers

1390 search results - page 196 / 278
» On the Algebraic Structure of Convergence
Sort
View
INFOCOM
2006
IEEE
16 years 12 days ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
DOCENG
2004
ACM
15 years 11 months ago
Querying XML documents by dynamic shredding
With the wide adoption of XML as a standard data representation and exchange format, querying XML documents becomes increasingly important. However, relational database systems co...
Hui Zhang 0003, Frank Wm. Tompa
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 10 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
COMPGEOM
2007
ACM
15 years 10 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
EDM
2008
97views Data Mining» more  EDM 2008»
15 years 7 months ago
Using Item-type Performance Covariance to Improve the Skill Model of an Existing Tutor
Using data from an existing pre-algebra computer-based tutor, we analyzed the covariance of item-types with the goal of describing a more effective way to assign skill labels to it...
Philip I. Pavlik, Hao Cen, Lili Wu, Kenneth R. Koe...