Sciweavers

2654 search results - page 350 / 531
» On Pairing Inversion Problems
Sort
View
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
15 years 10 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
WEBI
2005
Springer
15 years 10 months ago
Providing Expert Advice by Analogy for On-Line Help
One of the principal problems of online help is the mismatch between the specialized knowledge and technical vocabulary of experts who are providing the help, and the relative na...
Henry Lieberman, Ashwani Kumar
COMPGEOM
2004
ACM
15 years 10 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
147
Voted
NMR
2004
Springer
15 years 10 months ago
Plan reversals for recovery in execution monitoring
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
Thomas Eiter, Esra Erdem, Wolfgang Faber
RTSS
2002
IEEE
15 years 9 months ago
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements
In addition to real-time requirements, the program code size is a critical design factor for real-time embedded systems. To take advantage of the code size vs. execution time trad...
Insik Shin, Insup Lee, Sang Lyul Min