Sciweavers

402 search results - page 77 / 81
» On Finding the Number of Graph Automorphisms
Sort
View
COR
2010
123views more  COR 2010»
13 years 7 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
BMCBI
2008
116views more  BMCBI 2008»
13 years 7 months ago
Algorithm of OMA for large-scale orthology inference
Since the publication of our article (Roth, Gonnet, and Dessimoz: BMC Bioinformatics 2008 9: 518), we have noticed several errors, which we correct in the following. Correction We...
Alexander C. J. Roth, Gaston H. Gonnet, Christophe...
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
14 years 9 months ago
Group Linkage
Poor quality data is prevalent in databases due to a variety of reasons, including transcription errors, lack of standards for recording database fields, etc. To be able to query ...
Byung-Won On, Nick Koudas, Dongwon Lee, Divesh Sri...
SIGSOFT
2007
ACM
14 years 8 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
VLDB
2008
ACM
103views Database» more  VLDB 2008»
14 years 7 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...