Sciweavers

3136 search results - page 141 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
EWC
2006
120views more  EWC 2006»
15 years 6 months ago
A comparison of two optimization methods for mesh quality improvement
We compare inexact Newton and block coordinate descent optimization methods for improving the quality of a mesh by repositioning the vertices, where the overall quality is measure...
Lori Freitag Diachin, Patrick M. Knupp, Todd S. Mu...
ICC
2007
IEEE
127views Communications» more  ICC 2007»
16 years 20 days ago
Efficient Factorisation Algorithm for List Decoding Algebraic-Geometric and Reed-Solomon Codes
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...
L. Chen, Rolando A. Carrasco, Martin Johnston, E. ...
CIDM
2009
IEEE
15 years 11 months ago
An architecture and algorithms for multi-run clustering
—This paper addresses two main challenges for clustering which require extensive human effort: selecting appropriate parameters for an arbitrary clustering algorithm and identify...
Rachsuda Jiamthapthaksin, Christoph F. Eick, Vadee...
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
15 years 10 months ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
AI
2010
Springer
15 years 6 months ago
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...