2526 search results - page 356 / 506 » A New Algorithm for Answer Set Computation |
146
Voted
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
120
Voted
IAT
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
151
click to vote
AAAI
1994
15 years 3 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
144
Voted
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
136
Voted
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...