Sciweavers

7015 search results - page 340 / 1403
» Approximation algorithms for co-clustering
Sort
View
ACSC
2006
IEEE
16 years 24 days ago
Approximative filtering of XML documents in a publish/subscribe system
Publish/subscribe systems filter published documents and inform their subscribers about documents matching their interests. Recent systems have focussed on documents or messages ...
Annika Hinze, Yann Michel, Torsten Schlieder
IJCNN
2006
IEEE
16 years 23 days ago
High-speed Bi-directional Function Approximation using Plausible Neural Networks
— This paper applies a recently developed neural network called plausible neural network (PNN) to function approximation. Instead of using error correction, PNN estimates the mut...
Kuo-Chen Li, Dar-Jen Chang, Yuan Yan Chen
ANSS
2005
IEEE
16 years 11 days ago
Approximation of Discrete Phase-Type Distributions
The analysis of discrete stochastic models such as generally distributed stochastic Petri nets can be done using state space-based methods. The behavior of the model is described ...
Claudia Isensee, Graham Horton
CONIELECOMP
2005
IEEE
16 years 10 days ago
Approximate Searching on Compressed Text
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
Carlos Avendaño Pérez, Claudia Fereg...
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
16 years 6 days ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey