Sciweavers

3946 search results - page 200 / 790
» The computational complexity of choice sets
Sort
View
SG
2005
Springer
16 years 3 days ago
Metrics for Functional and Aesthetic Label Layouts
Abstract. Co-referential relations between textual and visual elements in illustrations can be encoded efficiently through textual labels. The labels support students to learn unk...
Knut Hartmann, Timo Götzelmann, Kamran Ali, T...
IWCMC
2010
ACM
15 years 11 months ago
Turbo packet combining techniques for multi-relay-assisted systems over multi-antenna broadband channels
This paper focuses on turbo packet combining techniques for multi-relay-assisted systems operating over multiple-input multiple-output (MIMO) broadband channel. Two packet combini...
Houda Chafnaji, Halim Yanikomeroglu, Tarik Ait-Idi...
USENIX
2008
15 years 9 months ago
A Comparative Experimental Study of Parallel File Systems for Large-Scale Data Processing
Large-scale scientific and business applications require data processing of ever-increasing amounts of data, fueling a demand for scalable parallel file systems comprising hundred...
Zoe Sebepou, Kostas Magoutis, Manolis Marazakis, A...
AAAI
1998
15 years 8 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
ET
2007
123views more  ET 2007»
15 years 6 months ago
Defect-tolerant Logic with Nanoscale Crossbar Circuits
Crossbar architectures are one approach to molecular electronic circuits for memory and logic applications. However, currently feasible manufacturing technologies introduce numero...
Tad Hogg, Greg Snider