Sciweavers

1963 search results - page 358 / 393
» The Maximum Solution Problem on Graphs
Sort
View
122
Voted
CP
2011
Springer
14 years 19 days ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny
113
Voted
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 5 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
85
Voted
ESOP
2001
Springer
15 years 5 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
15 years 15 days ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
151
Voted
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 7 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma