Sciweavers

694 search results - page 31 / 139
» Open Graphs and Computational Reasoning
Sort
View
GD
2009
Springer
13 years 6 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
AAAI
2004
13 years 10 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
CVPR
2010
IEEE
14 years 5 months ago
Parallel and Distributed Graph Cuts by Dual Decomposition
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
Petter Strandmark, Fredrik Kahl
CCGRID
2005
IEEE
14 years 2 months ago
Secret sequence comparison on public grid computing resources
Once a new gene has been sequenced, it must be verified whether or not it is similar to previously sequenced genes. In many cases, the organization that sequenced a potentially n...
Ken-ichi Kurata, Hiroshi Nakamura, Vincent Breton
ICTAI
2010
IEEE
13 years 6 months ago
Pocket Data Mining: Towards Collaborative Data Mining in Mobile Computing Environments
Abstract--Pocket Data Mining PDM is our new term describing collaborative mining of streaming data in mobile and distributed computing environments. With sheer amounts of data stre...
Frederic T. Stahl, Mohamed Medhat Gaber, Max Brame...