Sciweavers

4377 search results - page 565 / 876
» Mass problems and randomness
Sort
View
BMCBI
2007
109views more  BMCBI 2007»
15 years 6 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
TIT
2002
95views more  TIT 2002»
15 years 6 months ago
On sequential strategies for loss functions with memory
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Mar...
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
14 years 9 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
DCOSS
2011
Springer
14 years 6 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt
CVPR
2009
IEEE
17 years 1 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...