Sciweavers

250 search results - page 46 / 50
» General variable neighborhood search for the continuous opti...
Sort
View
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
15 years 9 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
BMCBI
2010
132views more  BMCBI 2010»
14 years 9 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
65
Voted
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 4 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
GECCO
2006
Springer
186views Optimization» more  GECCO 2006»
15 years 1 months ago
Genetic programming for agricultural purposes
Nitrogen is one of the most important chemical intakes to ensure the healthy growth of agricultural crops. However, some environmental concerns emerge (soil and water pollution) w...
Clément Chion, Luis E. Da Costa, Jacques-An...
CVPR
2009
IEEE
16 years 4 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...