Sciweavers

2084 search results - page 382 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
AI
2008
Springer
14 years 9 months ago
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
Chitta Baral, Thomas Eiter, Marcus Bjäreland,...
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
14 years 10 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
ICCV
1999
IEEE
15 years 11 months ago
Segmentation of Salient Closed Contours from Real Images
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
Shyjan Mahamud, Karvel K. Thornber, Lance R. Willi...
ITCC
2005
IEEE
15 years 3 months ago
Design Theoretic Approach to Replicated Declustering
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
Ali Saman Tosun
EOR
2010
125views more  EOR 2010»
14 years 9 months ago
Efficient estimation of large portfolio loss probabilities in t-copula models
We consider the problem of accurately measuring the credit risk of a portfolio consisting of loans, bonds and other financial assets. One particular performance measure of interes...
Joshua C. C. Chan, Dirk P. Kroese