Sciweavers

10414 search results - page 1614 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
ATAL
2008
Springer
15 years 9 months ago
Not all agents are equal: scaling up distributed POMDPs for agent networks
Many applications of networks of agents, including mobile sensor networks, unmanned air vehicles, autonomous underwater vehicles, involve 100s of agents acting collaboratively und...
Janusz Marecki, Tapana Gupta, Pradeep Varakantham,...
CIKM
2008
Springer
15 years 8 months ago
Achieving both high precision and high recall in near-duplicate detection
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
Lian'en Huang, Lei Wang, Xiaoming Li
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 8 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
UAI
2004
15 years 8 months ago
Recovering Articulated Object Models from 3D Range Data
We address the problem of unsupervised learning of complex articulated object models from 3D range data. We describe an algorithm whose input is a set of meshes corresponding to d...
Dragomir Anguelov, Daphne Koller, Hoi-Cheung Pang,...
« Prev « First page 1614 / 2083 Last » Next »