Sciweavers

4850 search results - page 599 / 970
» Approximate Data Structures with Applications
Sort
View
ICFP
2006
ACM
16 years 6 months ago
A technique for generic iteration and its optimization
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...
Stephen M. Watt
EUROSYS
2007
ACM
16 years 3 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek
SCALESPACE
2009
Springer
16 years 1 months ago
PDE-Driven Adaptive Morphology for Matrix Fields
Matrix fields are important in many applications since they are the adequate means to describe anisotropic behaviour in image processing models and physical measurements. A promin...
Bernhard Burgeth, Michael Breuß, Luis Pizarr...
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
16 years 1 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom
ER
2007
Springer
142views Database» more  ER 2007»
16 years 29 days ago
Automatic Hidden-Web Table Interpretation by Sibling Page Comparison
The longstanding problem of automatic table interpretation still illudes us. Its solution would not only be an aid to table processing applications such as large volume table conve...
Cui Tao, David W. Embley