Sciweavers

702 search results - page 53 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
SOICT
2010
14 years 6 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
15 years 12 months ago
On Schema Matching with Opaque Column Names and Data Values
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
Jaewoo Kang, Jeffrey F. Naughton
CIT
2007
Springer
15 years 6 months ago
Performance Assessment of Some Clustering Algorithms Based on a Fuzzy Granulation-Degranulation Criterion
In this paper a fuzzy quantization dequantization criterion is used to propose an evaluation technique to determine the appropriate clustering algorithm suitable for a particular ...
Sriparna Saha, Sanghamitra Bandyopadhyay
IWCMC
2010
ACM
15 years 4 months ago
Group detection in mobility traces
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
Yung-Chih Chen, Elisha J. Rosensweig, Jim Kurose, ...
BMCBI
2010
145views more  BMCBI 2010»
14 years 12 months ago
JCoDA: a tool for detecting evolutionary selection
Background: The incorporation of annotated sequence information from multiple related species in commonly used databases (Ensembl, Flybase, Saccharomyces Genome Database, Wormbase...
Steven N. Steinway, Ruth Dannenfelser, Christopher...