Sciweavers

2612 search results - page 366 / 523
» Assemblies as Graph Processes
Sort
View
CVPR
2011
IEEE
15 years 1 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
145
Voted
ECEASST
2010
14 years 12 months ago
Support for Bidirectional Model-to-Text Transformations
In recent years, model-driven approaches and processes have1 established themselves as pragmatic and feasible solutions with tangible2 advantages. Transformations play a central ro...
Anthony Anjorin, Marius Paul Lauder, Michael Schle...
143
Voted
HOTNETS
2010
14 years 12 months ago
Packet re-cycling: eliminating packet losses due to network failures
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
Suksant Sae Lor, Raul Landa, Miguel Rio
PAMI
2010
207views more  PAMI 2010»
14 years 11 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
INFOCOM
2011
IEEE
14 years 8 months ago
Utilizing shared vehicle trajectories for data forwarding in vehicular networks
—Vehicular ad hoc networks (VANETs) represent promising technologies for improving driving safety and efficiency. Due to the highly dynamic driving patterns of vehicles, it has ...
Fulong Xu, Shuo Guo, Jaehoon Jeong, Yu Gu, Qing Ca...