12257 search results - page 268 / 2452 » Analysis of Algorithms |
130
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
133
Voted
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
114
Voted
FGCS
2006
15 years 3 months ago
2006
The article presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements sig...
140
Voted
ETRA
2000
ACM
15 years 7 months ago
2000
ACM
The process of fixation identification--separating and labeling fixations and saccades in eye-tracking protocols--is an essential part of eye-movement data analysis and can have a...
134
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...