Sciweavers

2621 search results - page 64 / 525
» Near orders and codes
Sort
View
AAAI
2007
15 years 6 months ago
Strongly Decomposable Voting Rules on Multiattribute Domains
Sequential composition of voting rules, by making use of structural properties of the voters’ preferences, provide computationally economical ways for making a common decision o...
Lirong Xia, Jérôme Lang, Mingsheng Yi...
SC
2009
ACM
15 years 11 months ago
Scalable temporal order analysis for large scale debugging
We present a scalable temporal order analysis technique that supports debugging of large scale applications by classifying MPI tasks based on their logical program execution order...
Dong H. Ahn, Bronis R. de Supinski, Ignacio Laguna...
VLSISP
2008
104views more  VLSISP 2008»
15 years 4 months ago
Guidance of Loop Ordering for Reduced Memory Usage in Signal Processing Applications
Data dominated signal processing applications are typically described using large and multi-dimensional arrays and loop nests. The order of production and consumption of array ele...
Per Gunnar Kjeldsberg, Francky Catthoor, Sven Verd...
GLOBECOM
2006
IEEE
15 years 10 months ago
Improved High-rate Space-Time-Frequency Block Codes
— High-rate space-time-frequency block codes (STFBC) are promising for achieving high bandwidth efficiency, low overhead and latency. Recently, a class of low-complexity STFBC m...
Jinsong Wu, Steven D. Blostein
DAGSTUHL
2006
15 years 5 months ago
Clone Detector Use Questions: A List of Desirable Empirical Studies
Abstract. Code "clones" are similar segments of code that are frequently introduced by "scavenging" existing code, that is, reusing code by copying it and adapt...
Thomas R. Dean, Massimiliano Di Penta, Kostas Kont...