9842 search results - page 1483 / 1969 » Problem complexity |
173
click to vote
LPNMR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
191
click to vote
CIKM
1999
Springer
15 years 11 months ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
189
click to vote
RTSS
1998
IEEE
15 years 11 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
180
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
149
click to vote
CVPR
1996
IEEE
15 years 11 months ago
1996
IEEE
The Saliency Network proposed by Shashua and Ullman (1988) is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This pa...