Sciweavers

868 search results - page 66 / 174
» Finding Most Likely Solutions
Sort
View
GRID
2006
Springer
15 years 21 days ago
A QoS-Aware Heuristic Algorithm for Replica Placement
This paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ign...
Hsiangkai Wang, Pangfeng Liu, Jan-Jan Wu
126
Voted
JAR
2006
106views more  JAR 2006»
15 years 20 days ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
CVPR
2007
IEEE
16 years 2 months ago
Sparse Kernels for Bayes Optimal Discriminant Analysis
Discriminant Analysis (DA) methods have demonstrated their utility in countless applications in computer vision and other areas of research ? especially in the C class classificat...
Aleix M. Martínez, Onur C. Hamsici
KDD
2005
ACM
140views Data Mining» more  KDD 2005»
16 years 1 months ago
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...
BMCBI
2010
152views more  BMCBI 2010»
15 years 25 days ago
Apples and oranges: avoiding different priors in Bayesian DNA sequence analysis
Background: One of the challenges of bioinformatics remains the recognition of short signal sequences in genomic DNA such as donor or acceptor splice sites, splicing enhancers or ...
Jens Keilwagen, Jan Grau, Stefan Posch, Ivo Grosse