2774 search results - page 544 / 555 » Exploiting Deep Structure |
PAMI
2007
14 years 11 months ago
2007
—An open vision problem is to automatically track the articulations of people from a video sequence. This problem is difficult because one needs to determine both the number of p...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
EUROPAR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Current multicore computers differ in many hardware aspects. Tuning parallel applications is indispensable to achieve best performance on a particular hardware platform....
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
INFORMS
2010
14 years 10 months ago
2010
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...