Sciweavers

1243 search results - page 60 / 249
» Complexity reduction of C-Algorithm
Sort
View
SIGGRAPH
1999
ACM
15 years 5 months ago
LCIS: A Boundary Hierarchy for Detail-Preserving Contrast Reduction
High contrast scenes are difficult to depict on low contrast displays without loss of important fine details and textures. Skilled artists preserve these details by drawing scen...
Jack Tumblin, Greg Turk
HPDC
2010
IEEE
15 years 2 months ago
Browsing large scale cheminformatics data with dimension reduction
Visualization of large-scale high dimensional data tool is highly valuable for scientific discovery in many fields. We present PubChemBrowse, a customized visualization tool for c...
Jong Youl Choi, Seung-Hee Bae, Judy Qiu, Geoffrey ...
PODC
2012
ACM
13 years 3 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
FSTTCS
1992
Springer
15 years 5 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami
TCOM
2011
83views more  TCOM 2011»
14 years 8 months ago
Minimizing Sum-MSE Implies Identical Downlink and Dual Uplink Power Allocations
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
Adam J. Tenenbaum, Raviraj S. Adve