Sciweavers

9284 search results - page 1697 / 1857
» Knowledge State Algorithms
Sort
View
CIKM
2010
Springer
15 years 5 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 5 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
PAMI
2010
174views more  PAMI 2010»
15 years 4 months ago
Skewed Rotation Symmetry Group Detection
—We present a novel and effective algorithm for affinely skewed rotation symmetry group detection from real-world images. We define a complete skewed rotation symmetry detectio...
Seungkyu Lee, Yanxi Liu
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 4 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
TKDE
2010
153views more  TKDE 2010»
15 years 4 months ago
Automatic Ontology Matching via Upper Ontologies: A Systematic Evaluation
—“Ontology matching” is the process of finding correspondences between entities belonging to different ontologies. This paper describes a set of algorithms that exploit uppe...
Viviana Mascardi, Angela Locoro, Paolo Rosso
« Prev « First page 1697 / 1857 Last » Next »