Sciweavers

635 search results - page 53 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
15 years 9 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
15 years 4 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
86
Voted
ECCV
2010
Springer
15 years 1 months ago
Bundle Adjustment in the Large
Abstract. We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We ex...
MDM
2004
Springer
147views Communications» more  MDM 2004»
15 years 3 months ago
Mobile Agents: Can They Assist with Context Awareness?
This position paper argues that the mobile agents paradigm is a useful and important technology enabling pervasive and ubiquitous computing. Context awareness drives adaptability ...
Arkady B. Zaslavsky
SOFSEM
2007
Springer
15 years 3 months ago
Incremental Learning of Planning Operators in Stochastic Domains
In this work we assume that there is an agent in an unknown environment (domain). This agent has some predefined actions and it can perceive its current state in the environment c...
Javad Safaei, Gholamreza Ghassem-Sani