Sciweavers

7758 search results - page 383 / 1552
» On the Number of Distributive Lattices
Sort
View
CP
2006
Springer
15 years 10 months ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan
CCGRID
2001
IEEE
15 years 10 months ago
Latency Hiding in Dynamic Partitioning and Load Balancing of Grid Computing Applications
The Information Power Grid (IPG) concept developed by NASA is aimed to provide a metacomputing platform for large-scale distributed computations, by hiding the intricacies of a hig...
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 7 months ago
Fast space-variant elliptical filtering using box splines
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
Kunal Narayan Chaudhury, Arrate Muñoz-Barru...
BMCBI
2005
93views more  BMCBI 2005»
15 years 6 months ago
Computing expectation values for RNA motifs using discrete convolutions
Background: Computational biologists use Expectation values (E-values) to estimate the number of solutions that can be expected by chance during a database scan. Here we focus on ...
André Lambert, Matthieu Legendre, Jean-Fred...
INFOCOM
2010
IEEE
15 years 5 months ago
Opportunistic Spectrum Access with Multiple Users: Learning under Competition
Abstract—The problem of cooperative allocation among multiple secondary users to maximize cognitive system throughput is considered. The channel availability statistics are initi...
Animashree Anandkumar, Nithin Michael, Ao Tang