1786 search results - page 120 / 358 » The Structure of Factor Oracles |
188
click to vote
AVI
2006
15 years 7 months ago
2006
In this paper we describe NAVRNA, an interactive system that enables biologists or researchers in bioinformatics to visualize, explore and edit RNA molecules. The key characterist...
145
click to vote
ISSAC
2007
Springer
16 years 16 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
132
click to vote
IWANN
2005
Springer
15 years 12 months ago
2005
Springer
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
153
click to vote
ECIS
2003
15 years 7 months ago
2003
This paper proposes a study of the effects of knowledge management systems (KMS) on individual and organizational performance. The study seeks to answer the following question: Wh...
154
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...