Sciweavers

2489 search results - page 220 / 498
» On the Subgroup Distance Problem
Sort
View
125
Voted
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
15 years 9 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
IPPS
1997
IEEE
15 years 9 months ago
Broadcasting and Multicasting in Cut-through Routed Networks
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
Johanne Cohen, Pierre Fraigniaud, Jean-Claude K&ou...
ICASSP
2010
IEEE
15 years 4 months ago
Statistical Resolution Limit for multiple parameters of interest and for multiple signals
The concept of Statistical Resolution Limit (SRL), which is defined as the minimal separation to resolve two closely spaced signals, is an important tool to quantify performance ...
Mohammed Nabil El Korso, Rémy Boyer, Alexan...
IOR
2008
62views more  IOR 2008»
15 years 4 months ago
Improved Bounds for the Symmetric Rendezvous Value on the Line
A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apar...
Qiaoming Han, Donglei Du, Juan Vera, Luis F. Zulua...
162
Voted
VLDB
2002
ACM
110views Database» more  VLDB 2002»
15 years 4 months ago
Eliminating Fuzzy Duplicates in Data Warehouses
The duplicate elimination problem of detecting multiple tuples, which describe the same real world entity, is an important data cleaning problem. Previous domain independent solut...
Rohit Ananthakrishna, Surajit Chaudhuri, Venkatesh...