Sciweavers

7106 search results - page 142 / 1422
» Restricted Complexity, General Complexity
Sort
View
150
Voted
IJCGA
2010
155views more  IJCGA 2010»
15 years 1 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
121
Voted
BMVC
2010
15 years 24 days ago
Label propagation in complex video sequences using semi-supervised learning
We propose a novel directed graphical model for label propagation in lengthy and complex video sequences. Given hand-labelled start and end frames of a video sequence, a variation...
Ignas Budvytis, Vijay Badrinarayanan, Roberto Cipo...
148
Voted
CISIS
2009
IEEE
15 years 18 days ago
Making Expert Knowledge Explicit to Facilitate Tool Support for Integrating Complex Information Systems in the ATM Domain
The capability to provide a platform for flexible business services in the Air Traffic Management (ATM) domain is both a major success factor for the ATM industry and a challenge ...
Thomas Moser, Richard Mordinyi, Alexander Mikula, ...
127
Voted
DM
2011
264views Education» more  DM 2011»
14 years 9 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
101
Voted
CP
2005
Springer
15 years 8 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus