Sciweavers

3471 search results - page 641 / 695
» Obstacle Numbers of Graphs
Sort
View
ICDE
2010
IEEE
322views Database» more  ICDE 2010»
16 years 3 months ago
XML-Based Computation for Scientific Workflows
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
Bertram Ludäscher, Daniel Zinn, Shawn Bowers
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 1 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 1 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 10 months ago
Optimizing joins in a map-reduce environment
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
Foto N. Afrati, Jeffrey D. Ullman
DATE
2009
IEEE
189views Hardware» more  DATE 2009»
15 years 10 months ago
CUFFS: An instruction count based architectural framework for security of MPSoCs
—Multiprocessor System on Chip (MPSoC) architecture is rapidly gaining momentum for modern embedded devices. The vulnerabilities in software on MPSoCs are often exploited to caus...
Krutartha Patel, Sri Parameswaran, Roshan G. Ragel