Sciweavers

4110 search results - page 242 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
15 years 6 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
CLEANDB
2006
ACM
112views Database» more  CLEANDB 2006»
15 years 10 months ago
Generic Entity Resolution with Data Confidences
We consider the Entity Resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively ...
David Menestrina, Omar Benjelloun, Hector Garcia-M...
EOR
2008
75views more  EOR 2008»
15 years 6 months ago
GRASP and path relinking for project scheduling under partially renewable resources
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and...
Ramón Alvarez-Valdés, Enric Crespo, ...
ICDE
2002
IEEE
128views Database» more  ICDE 2002»
16 years 8 months ago
Efficiently Ordering Query Plans for Data Integration
The goal of a data integration system is to provide a uniform interface to a multitude of data sources. Given a user query formulated in this interface, the system translates it i...
AnHai Doan, Alon Y. Halevy
TPDS
2002
97views more  TPDS 2002»
15 years 6 months ago
On Distributed Dynamic Channel Allocation in Mobile Cellular Networks
Distributed dynamic channel allocation (DDCA) is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not e...
Jianping Jiang, Ten-Hwang Lai, Neelam Soundarajan