Sciweavers

2370 search results - page 75 / 474
» A Structured Set of Higher-Order Problems
Sort
View
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 8 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
DBPL
1991
Springer
98views Database» more  DBPL 1991»
14 years 15 days ago
Structural Recursion as a Query Language
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
Val Tannen, Peter Buneman, Shamim A. Naqvi
ALIFE
1998
13 years 8 months ago
Computational Models for the Formation of Protocell Structures
There have been various attempts to simulate the self-assembly process of lipid aggregates by computers. However, due to the computationally complex nature of the problem, previou...
Linglan Edwards, Yun Peng, James A. Reggia
SSPR
2004
Springer
14 years 2 months ago
Symbols Recognition System for Graphic Documents Combining Global Structural Approaches and Using a XML Representation of Data
In this paper we present a symbols recognition system for graphic documents, based on a combination of global structural approaches. Our system allows to extract components and the...
Mathieu Delalandre, Éric Trupin, Jean-Marc ...
TKDE
2010
148views more  TKDE 2010»
13 years 7 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang