Sciweavers

1088 search results - page 72 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
IAT
2005
IEEE
14 years 4 months ago
Analyzing Myopic Approaches for Multi-Agent Communication
Choosing when to communicate is a fundamental problem in multi-agent systems. This problem becomes particularly hard when communication is constrained and each agent has different...
Raphen Becker, Victor R. Lesser, Shlomo Zilberstei...
LATA
2010
Springer
14 years 3 months ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
Christophe Costa Florêncio, Henning Fernau
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
14 years 4 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
ICCV
2011
IEEE
12 years 10 months ago
HEAT: Iterative Relevance Feedback with One Million Images
It has been shown repeatedly that iterative relevance feedback is a very efficient solution for content-based image retrieval. However, no existing system scales gracefully to hu...
Nicolae Suditu, Francois Fleuret
SIGMOD
2005
ACM
111views Database» more  SIGMOD 2005»
14 years 10 months ago
Efficient Computation of Multiple Group By Queries
Data analysts need to understand the quality of data in the warehouse. This is often done by issuing many Group By queries on the sets of columns of interest. Since the volume of ...
Zhimin Chen, Vivek R. Narasayya