Sciweavers

10493 search results - page 1923 / 2099
» Dynamic Word Problems
Sort
View
CCGRID
2007
IEEE
14 years 2 months ago
Revisit of View-Oriented Parallel Programming
Traditional parallel programming styles have many problems which hinder the development of parallel applications. The message passing style can be too complex for many programmers...
Z. Huang, W. Chen
ICC
2007
IEEE
125views Communications» more  ICC 2007»
14 years 2 months ago
A Two-Layer Characteristic-based Rate Control Framework for Low Delay Video Transmission
— In this paper, we present a two-layer rate control In [4], their rate controller TMN8 applied the Lagrange framework for low delay video transmission based on a multiplier to d...
Chun-Yuan Chang, Ming-Hung Chen, Cheng-Fu Chou, Di...
ICQNM
2007
IEEE
131views Chemistry» more  ICQNM 2007»
14 years 2 months ago
Comparison of two bounds of the quantum correlation set
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
David Avis, Tsuyoshi Ito
IRI
2007
IEEE
14 years 2 months ago
Enhancing Text Analysis via Dimensionality Reduction
Many applications require analyzing vast amounts of textual data, but the size and inherent noise of such data can make processing very challenging. One approach to these issues i...
David G. Underhill, Luke McDowell, David J. Marche...
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 2 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
« Prev « First page 1923 / 2099 Last » Next »