Sciweavers

4542 search results - page 293 / 909
» Design patterns for data structures
Sort
View
DAC
2008
ACM
16 years 7 months ago
Miss reduction in embedded processors through dynamic, power-friendly cache design
Today, embedded processors are expected to be able to run complex, algorithm-heavy applications that were originally designed and coded for general-purpose processors. As a result...
Garo Bournoutian, Alex Orailoglu
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
15 years 10 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
IVS
2007
120views more  IVS 2007»
15 years 6 months ago
Visual exploration and analysis of historic hotel visits
Understanding the spatial and temporal characteristics of individual and group behavior in social networks is a critical component of visual tools for intelligence analysis, emerg...
Chris Weaver, David Fyfe, Anthony Robinson, Deryck...
DASFAA
2011
IEEE
250views Database» more  DASFAA 2011»
14 years 10 months ago
An FTL-Agnostic Layer to Improve Random Write on Flash Memory
Flash memories are considered a competitive alternative to rotating disks as non-volatile data storage for database management systems. However, even if the Flash Translation Layer...
Brice Chardin, Olivier Pasteur, Jean-Marc Petit
JGAA
2007
135views more  JGAA 2007»
15 years 6 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento