Sciweavers

224 search results - page 10 / 45
» The Complexity of Finding Replicas Using Equality Tests
Sort
View
ECCC
2011
223views ECommerce» more  ECCC 2011»
14 years 4 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
TSMC
2002
110views more  TSMC 2002»
14 years 9 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
CHI
2010
ACM
15 years 4 months ago
Understanding usability practices in complex domains
Although usability methods are widely used for evaluating conventional graphical user interfaces and websites, there is a growing concern that current approaches are inadequate fo...
Parmit K. Chilana, Jacob O. Wobbrock, Andrew J. Ko
JOCN
2010
95views more  JOCN 2010»
14 years 8 months ago
Visual Short-term Memory Capacity for Simple and Complex Objects
■ Does the capacity of visual short-term memory (VSTM) depend on the complexity of the objects represented in memory? Although some previous findings indicated lower capacity fo...
Roy Luria, Paola Sessa, Alex Gotler, Pierre Jolico...
DCC
2009
IEEE
15 years 10 months ago
H.264/MPEG-4 AVC Encoder Parameter Selection Algorithms for Complexity Distortion Tradeoff
The H.264 encoder has input parameters that determine the bit rate and distortion of the compressed video and the encoding complexity. A set of encoder parameters is referred to a...
Rahul Vanam, Eve A. Riskin, Richard E. Ladner