Sciweavers

251 search results - page 31 / 51
» Distributed subgradient projection algorithm for convex opti...
Sort
View
IPPS
1999
IEEE
15 years 6 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
MP
2006
142views more  MP 2006»
15 years 2 months ago
Exploring the Relationship Between Max-Cut and Stable Set Relaxations
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
Monia Giandomenico, Adam N. Letchford
GLOBECOM
2008
IEEE
15 years 3 months ago
Cross-Layer Rate Allocation for Multimedia Applications in Pervasive Computing Environment
Abstract— An important issue for supporting multimedia applications in multiple heterogeneous networks, a typical pervasive computing environment, is how to optimize the rate all...
Liang Zhou, Benoit Geller, Anne Wei, Baoyu Zheng, ...
122
Voted
SPIESR
1997
97views Database» more  SPIESR 1997»
15 years 3 months ago
Multiscale Branch-and-Bound Image Database Search
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
Jau-Yuen Chen, Charles A. Bouman, Jan P. Allebach
CP
2004
Springer
15 years 7 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith