Sciweavers

2398 search results - page 387 / 480
» Constraint Programming and Graph Algorithms
Sort
View
134
Voted
ECML
2007
Springer
15 years 8 months ago
Learning Metrics Between Tree Structured Data: Application to Image Recognition
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
Laurent Boyer 0002, Amaury Habrard, Marc Sebban
138
Voted
ESTIMEDIA
2007
Springer
15 years 8 months ago
Run-time Task Overlapping on Multiprocessor Platforms
Today’s embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into subtasks which are in turn assigned and scheduled on multiple different...
Zhe Ma, Daniele Paolo Scarpazza, Francky Catthoor
104
Voted
AAECC
2006
Springer
105views Algorithms» more  AAECC 2006»
15 years 8 months ago
LDPC Codes for Fading Channels: Two Strategies
Abstract. This paper compares two approaches to reliable communication over fading channels using low-density parity check (LDPC) codes. The particular model considered is the bloc...
Xiaowei Jin, Teng Li, Thomas E. Fuja, Oliver M. Co...
119
Voted
ICPR
2000
IEEE
15 years 6 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
102
Voted
CSCWD
2008
Springer
15 years 4 months ago
Task partition for function tree according to innovative functional reasoning
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
Yiming Tang, Xiaoping Liu