120 search results - page 11 / 24 » New completeness results for lazy conditional narrowing |
SIGGRAPH
1997
ACM
13 years 11 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
ADC
2008
Springer
14 years 1 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
ECP
1997
Springer
13 years 11 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
FROCOS
2005
Springer
14 years 1 months ago
2005
Springer
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
AUTOMATICA
2008
13 years 7 months ago
2008
We consider the problem of computing the root-mean-square (RMS) gain of switched linear systems. We develop a new approach which is based on an attempt to characterize the "w...