Sciweavers

2370 search results - page 204 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ADL
1997
Springer
171views Digital Library» more  ADL 1997»
15 years 8 months ago
Wavelet-Based Image Indexing Techniques with Partial Sketch Retrieval Capability
This paper describes WBIIS Wavelet-Based Image Indexing and Searching, a new image indexing and retrieval algorithm with partial sketch image searching capability for large imag...
James Ze Wang, Gio Wiederhold, Oscar Firschein, Sh...
AAAI
2008
15 years 6 months ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner
AAAI
2008
15 years 6 months ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
15 years 4 months ago
Reachability analysis for a class of Petri nets
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
Yu Ru, Christoforos N. Hadjicostis
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 4 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo