4542 search results - page 864 / 909 » Design patterns for data structures |
193
click to vote
ISCA
2011
IEEE
14 years 3 months ago
2011
IEEE
Due to shrinking feature sizes processors are becoming more vulnerable to soft errors. Write-back caches are particularly vulnerable since they hold dirty data that do not exist i...
125
click to vote
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
211
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
184
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
requirement. Furthermore, programming using sequence constructs normally produce nested structures and The current approachfor modeling synchronization in scattered code, especiall...
ICSE
2008
IEEE-ACM
16 years 19 days ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...