Sciweavers

11212 search results - page 187 / 2243
» Semi-persistent Data Structures
Sort
View
ECLIPSE
2005
ACM
15 years 8 months ago
eAssignment: a case for EMF
Developing Eclipse plug-ins often involves the creation of data structures and corresponding data processing code. In developing eAssignment, an Eclipse-bases application to suppo...
Marcel Bruch, Christoph Bockisch, Thorsten Sch&aum...
186
Voted
SIAMCOMP
2010
105views more  SIAMCOMP 2010»
15 years 1 months ago
Fast Access to Distributed Atomic Memory
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as...
Partha Dutta, Rachid Guerraoui, Ron R. Levy, Marko...
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
15 years 10 months ago
An Efficient Encoding and Labeling for Dynamic XML Data
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
Jun-Ki Min, Jihyun Lee, Chin-Wan Chung
TIP
2008
167views more  TIP 2008»
15 years 5 months ago
FIR Filter Banks for Hexagonal Data Processing
Images are conventionally sampled on a rectangular lattice, and they are also commonly stored as such a lattice. Thus, traditional image processing is carried out on the rectangula...
Q. Jiang
201
Voted
ISBI
2011
IEEE
14 years 10 months ago
Sparse topological data recovery in medical images
For medical image analysis, the test statistic of the measurements is usually constructed at every voxels in space and thresholded to determine the regions of significant signals...
Moo K. Chung, Hyekyoung Lee, Peter T. Kim, Jong Ch...