Sciweavers

1042 search results - page 158 / 209
» Failing First: An Update
Sort
View
AIPS
2011
13 years 1 months ago
Effective Heuristics and Belief Tracking for Planning with Incomplete Information
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
Alexandre Albore, Miquel Ramírez, Hector Ge...
NAR
2011
223views Computer Vision» more  NAR 2011»
13 years 23 days ago
HitPredict: a database of quality assessed protein-protein interactions in nine species
Despite the availability of a large number of protein– protein interactions (PPIs) in several species, researchers are often limited to using very small subsets in a few organis...
Ashwini Patil, Kenta Nakai, Haruki Nakamura
CVPR
2012
IEEE
12 years 10 days ago
Adaptive figure-ground classification
We propose an adaptive figure-ground classification algorithm to automatically extract a foreground region using a user-provided bounding-box. The image is first over-segmented wi...
Yisong Chen, Antoni B. Chan, Guoping Wang
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
EDBT
2004
ACM
174views Database» more  EDBT 2004»
14 years 10 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...