1068 search results - page 75 / 214 » For completeness, sublogarithmic space is no space |
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
LICS
1998
IEEE
14 years 10 days ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
AAAI
2008
13 years 11 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
JMM2
2008
13 years 8 months ago
2008
The design of virtual reality user interfaces (VRUI) is still an open field of research and development. One category of VRUI is the 3D floating menus that can be manipulated by us...
AIPS
2011
13 years 11 days ago
2011
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...