16430 search results - page 40 / 3286 » On Computable Tree Functions |
104
Voted
CSCLP
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
109
click to vote
RTSS
2006
IEEE
15 years 4 months ago
2006
IEEE
Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case...
CVPR
2008
IEEE
16 years 4 days ago
2008
IEEE
In this paper, we present a new approach for image labeling based on the recently introduced graph-shifts algorithm. Graph-shifts is an energy minimization algorithm that does lab...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...