4860 search results - page 458 / 972 » SNPs Problems, Complexity, and Algorithms |
136
click to vote
SIGGRAPH
2000
ACM
15 years 7 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
115
click to vote
IJCAI
2003
15 years 5 months ago
2003
In many applications of temporal reasoning we are in terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maint...
155
click to vote
IANDC
2008
15 years 4 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
140
click to vote
APIN
2002
15 years 3 months ago
2002
Abstract: Locally weighted learning (LWL) is a class of techniques from nonparametric statistics that provides useful representations and training algorithms for learning about com...
163
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...