125 search results - page 3 / 25 » N Semantic Classes are Harder than Two |
TARK
2005
Springer
15 years 3 months ago
2005
Springer
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...
101
click to vote
SP
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
112
click to vote
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
ORL
2008
14 years 9 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
ESA
1997
Springer
15 years 1 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...