Sciweavers

4171 search results - page 407 / 835
» Distributed Data Structure Design for Scientific Computation
Sort
View
EUROPAR
2000
Springer
15 years 10 months ago
A Combinatorial Characterization of Properties Preserved by Antitokens
Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distr...
Costas Busch, Neophytos Demetriou, Maurice Herlihy...
PODC
2011
ACM
14 years 9 months ago
Scalability versus semantics of concurrent FIFO queues
Maintaining data structure semantics of concurrent queues such as first-in first-out (FIFO) ordering requires expensive synchronization mechanisms which limit scalability. Howev...
Hannes Payer, Harald Röck, Christoph M. Kirsc...
WWW
2006
ACM
16 years 7 months ago
Template guided association rule mining from XML documents
Compared with traditional association rule mining in the structured world (e.g. Relational Databases), mining from XML data is confronted with more challenges due to the inherent ...
Rahman Ali Mohammadzadeh, Sadegh Soltan, Masoud Ra...
CGF
2006
155views more  CGF 2006»
15 years 6 months ago
Opacity Peeling for Direct Volume Rendering
The most important technique to visualize 3D scalar data, as they arise e.g. in medicine from tomographic measurement, is direct volume rendering. A transfer function maps the sca...
Christof Rezk-Salama, Andreas Kolb
IPPS
2006
IEEE
16 years 24 days ago
Broadcasting and routing in faulty mesh networks
— Broadcasting is a data communication task in which one processor sends the same message to all other processors. Routing is a task where a source processor sends a message to a...
Milos Stojmenovic, Amiya Nayak