Sciweavers

1191 search results - page 62 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
BMCBI
2005
125views more  BMCBI 2005»
13 years 9 months ago
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous ver...
Amarendran R. Subramanian, Jan Weyer-Menkhoff, Mic...
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 3 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
RTSS
2008
IEEE
14 years 3 months ago
Merge-by-Wire: Algorithms and System Support
Automakers are trying to make vehicles more intelligent and safe by embedding processors which can be used to implement by-wire applications for taking smart decisions on the road...
Vipul Shingde, Gurulingesh Raravi, Ashish Gudhe, P...
COLT
2008
Springer
13 years 11 months ago
On the Margin Explanation of Boosting Algorithms
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
Liwei Wang, Masashi Sugiyama, Cheng Yang, Zhi-Hua ...
AAAI
2010
13 years 10 months ago
Finding Optimal Solutions to Cooperative Pathfinding Problems
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
Trevor Scott Standley