Sciweavers

2370 search results - page 169 / 474
» A Structured Set of Higher-Order Problems
Sort
View
AIIA
2001
Springer
15 years 11 months ago
A Knowledge-Based Neurocomputing Approach to Extract Refined Linguistic Rules from Data
– This paper proposes a knowledge-based neurocomputing approach to extract and refine a set of linguistic rules from data. A neural network is designed along with its learning al...
Giovanna Castellano, Anna Maria Fanelli
KDD
1998
ACM
190views Data Mining» more  KDD 1998»
15 years 10 months ago
Mining Segment-Wise Periodic Patterns in Time-Related Databases
Periodicity search, that is, searchfor cyclicity in time-related databases, is an interesting data mining problem. Mostprevious studies have been on finding full-cycle periodicity...
Jiawei Han, Wan Gong, Yiwen Yin
CCCG
2008
15 years 7 months ago
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
Yurai Núñez Rodríguez, Henry ...
IDEAS
2005
IEEE
142views Database» more  IDEAS 2005»
16 years 10 hour ago
Automatically Maintaining Wrappers for Web Sources
A substantial subset of the web data follows some kind of underlying structure. Nevertheless, HTML does not contain any schema or semantic information about the data it represents...
Juan Raposo, Alberto Pan, Manuel Álvarez, J...
CP
2007
Springer
15 years 10 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti