945 search results - page 184 / 189 » Incremental Branching Programs |
KDD
2009
ACM
14 years 5 days ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
AOSD
2007
ACM
13 years 11 months ago
2007
ACM
Modern source-level debuggers support dynamic breakpoints that are guarded by conditions based on program state. Such breakpoints address situations where a static breakpoint is n...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
CONSTRAINTS
2008
13 years 7 months ago
2008
We present the Auckland Layout Model (ALM), a constraint-based technique for specifying 2D layout as it is used for arranging the controls in a GUI. Most GUI frameworks offer layo...