Sciweavers

37217 search results - page 7084 / 7444
» and 2010
Sort
View
ECCC
2008
93views more  ECCC 2008»
15 years 6 months ago
A Note on the Distance to Monotonicity of Boolean Functions
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
Arnab Bhattacharyya
ENTCS
2008
153views more  ENTCS 2008»
15 years 6 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
ENVSOFT
2008
80views more  ENVSOFT 2008»
15 years 6 months ago
Modifications to the SWAT code for modelling direct pesticide losses
In different river catchments in Europe, pesticide concentrations in surface waters frequently exceed the standards, possibly resulting in negative impacts on aquatic fauna and fl...
K. Holvoet, A. van Griensven, V. Gevaert, P. Seunt...
CVPR
2010
IEEE
15 years 5 months ago
Nonparametric Label-to-Region by Search
In this work, we investigate how to propagate annotated labels for a given single image from the image-level to their corresponding semantic regions, namely Label-toRegion (L2R), ...
Xiaobai Liu, Shuicheng Yan, Jiebo Luo
ICDT
2010
ACM
137views Database» more  ICDT 2010»
15 years 5 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou
« Prev « First page 7084 / 7444 Last » Next »