Sciweavers

120 search results - page 16 / 24
» Searching for close alternative plans
Sort
View
SPIRE
2005
Springer
15 years 11 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
IJCV
2007
140views more  IJCV 2007»
15 years 5 months ago
Background-Subtraction in Thermal Imagery Using Contour Saliency
We present a new contour-based background-subtraction technique to extract foreground objects in widely varying thermal imagery. Statistical background-subtraction is first used t...
James W. Davis, Vinay Sharma
JAIR
2010
115views more  JAIR 2010»
15 years 4 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
PVLDB
2008
81views more  PVLDB 2008»
15 years 5 months ago
Optimization of multi-domain queries on the web
Where can I attend an interesting database workshop close to a sunny beach? Who are the strongest experts on service computing based upon their recent publication record and accep...
Daniele Braga, Stefano Ceri, Florian Daniel, David...
NIL
1991
15 years 9 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass