Sciweavers

523 search results - page 26 / 105
» Decidability of string graphs
Sort
View
83
Voted
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
15 years 3 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
CIS
2010
Springer
14 years 4 months ago
Sensor Graphs for Guaranteed Cooperative Localization Performance
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of ...
Y. Yuan, H. G. Tanner
ICIP
2007
IEEE
15 years 11 months ago
A Case-Based Reasoning Approach for Unknown Class Invoice Processing
This paper introduces an invoice analysis approach using CaseBased Reasoning (CBR). CBR is used to analyze and interpret new invoices thanks to the previous processing experiences...
Abdel Belaïd, Hatem Hamza, Yolande Belaï...
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
15 years 9 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
70
Voted
ICALP
2010
Springer
15 years 2 months ago
Pumping and Counting on the Regular Post Embedding Problem
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
Pierre Chambart, Philippe Schnoebelen