Sciweavers

10901 search results - page 421 / 2181
» Approximations in Distributed Optimization
Sort
View
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
16 years 1 months ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont
INFOCOM
2010
IEEE
15 years 6 months ago
Tracking Quantiles of Network Data Streams with Dynamic Operations
— Quantiles are very useful in characterizing the data distribution of an evolving dataset in the process of data mining or network monitoring. The method of Stochastic Approxima...
Jin Cao, Li (Erran) Li, Aiyou Chen, Tian Bu
FOIKS
2004
Springer
16 years 29 days ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
TIP
1998
162views more  TIP 1998»
15 years 7 months ago
Variational image segmentation using boundary functions
Abstract—A general variational framework for image approximation and segmentation is introduced. By using a continuous “line-process” to represent edge boundaries, it is poss...
Gary A. Hewer, Charles S. Kenney, B. S. Manjunath
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 9 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals