Sciweavers

6004 search results - page 998 / 1201
» Parallelizing query optimization
Sort
View
CPHYSICS
2006
124views more  CPHYSICS 2006»
15 years 2 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
JMLR
2008
83views more  JMLR 2008»
15 years 2 months ago
Evidence Contrary to the Statistical View of Boosting
The statistical perspective on boosting algorithms focuses on optimization, drawing parallels with maximum likelihood estimation for logistic regression. In this paper we present ...
David Mease, Abraham Wyner
TVLSI
2008
90views more  TVLSI 2008»
15 years 2 months ago
A Special-Purpose Architecture for Solving the Breakpoint Median Problem
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
Jason D. Bakos, Panormitis E. Elenis
91
Voted
BC
2004
91views more  BC 2004»
15 years 1 months ago
Simulation and parameter estimation of dynamics of synaptic depression
Abstract. Synaptic release was simulated using a Simulink sequential storage model with three vesicular pools. Modeling was modular and easily extendable to the systems with greate...
F. Aristizabal, M. I. Glavinovic
HEURISTICS
2002
65views more  HEURISTICS 2002»
15 years 1 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...