Sciweavers

5889 search results - page 1042 / 1178
» Graph Layout Problems
Sort
View
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
15 years 11 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
COMPGEOM
2006
ACM
15 years 11 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
FOCS
2005
IEEE
15 years 10 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
142
Voted
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
15 years 10 months ago
Evolving petri nets to represent metabolic pathways
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
Jeremiah Nummela, Bryant A. Julstrom
165
Voted
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
15 years 10 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
« Prev « First page 1042 / 1178 Last » Next »