Sciweavers

2192 search results - page 123 / 439
» Algorithms for Challenging Motif Problems
Sort
View
CANS
2009
Springer
169views Cryptology» more  CANS 2009»
14 years 2 months ago
Privacy-Preserving Relationship Path Discovery in Social Networks
As social networks sites continue to proliferate and are being used for an increasing variety of purposes, the privacy risks raised by the full access of social networking sites ov...
Ghita Mezzour, Adrian Perrig, Virgil D. Gligor, Pa...
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 2 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
ISPDC
2007
IEEE
14 years 2 months ago
A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms
Mixed-parallel applications can take advantage of largescale computing platforms but scheduling them efficiently on such platforms is challenging. In this paper we compare the tw...
Tchimou N'Takpé, Frédéric Sut...
ICRA
2005
IEEE
149views Robotics» more  ICRA 2005»
14 years 1 months ago
A Markov Chain Monte Carlo Approach to Closing the Loop in SLAM
— The problem of simultaneous localization and mapping has received much attention over the last years. Especially large scale environments, where the robot trajectory loops back...
Michael Kaess, Frank Dellaert
IWANN
2005
Springer
14 years 1 months ago
Input Selection for Long-Term Prediction of Time Series
Prediction of time series is an important problem in many areas of science and engineering. Extending the horizon of predictions further to the future is the challenging and diffic...
Jarkko Tikka, Jaakko Hollmén, Amaury Lendas...