Sciweavers

26354 search results - page 5061 / 5271
» How we refactor, and how we know it
Sort
View
AFRICACRYPT
2010
Springer
15 years 8 months ago
Flexible Group Key Exchange with On-demand Computation of Subgroup Keys
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communica...
Michel Abdalla, Céline Chevalier, Mark Manu...
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 8 months ago
Reducing metadata complexity for faster table summarization
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
K. Selçuk Candan, Mario Cataldi, Maria Luis...
CDC
2008
IEEE
15 years 8 months ago
Convex duality and entropy-based moment closures: Characterizing degenerate densities
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
Cory D. Hauck, C. David Levermore, André L....
CISS
2008
IEEE
15 years 8 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
104
Voted
DATE
2008
IEEE
165views Hardware» more  DATE 2008»
15 years 8 months ago
TinyTimber, Reactive Objects in C for Real-Time Embedded Systems
Embedded systems are often operating under hard real-time constraints. Such systems are naturally described as time-bound reactions to external events, a point of view made manife...
Per Lindgren, Johan Eriksson, Simon Aittamaa, Joha...
« Prev « First page 5061 / 5271 Last » Next »