Sciweavers

943 search results - page 9 / 189
» How should data structures and algorithms be taught
Sort
View
101
Voted
MDAI
2009
Springer
15 years 2 months ago
Comparison of Data Structures for Computing Formal Concepts
Presented is preliminary study of the role of data structures in algorithms for formal concept analysis. Studied is performance of selected algorithms in dependence on chosen data ...
Petr Krajca, Vilém Vychodil
DAGSTUHL
2007
14 years 11 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
Nicolas Courtois
VLSISP
2008
147views more  VLSISP 2008»
14 years 8 months ago
Data Reuse Exploration for Low Power Motion Estimation Architecture Design in H.264 Encoder
Data access usually leads to more than 50% of the power cost in a modern signal processing system. To realize a low-power design, how to reduce the memory access power is a critica...
Yu-Han Chen, Tung-Chien Chen, Chuan-Yung Tsai, Sun...
COLING
2008
14 years 11 months ago
Generation of Referring Expressions: Managing Structural Ambiguities
Existing algorithms for the Generation of Referring Expressions tend to generate distinguishing descriptions at the semantic level, disregarding the ways in which surface issues c...
Imtiaz Hussain Khan, Kees van Deemter, Graeme Ritc...
IPSN
2007
Springer
15 years 3 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...