Sciweavers

219 search results - page 28 / 44
» Optimal dyadic decision trees
Sort
View
140
Voted
ISVC
2007
Springer
15 years 9 months ago
Feature-Adaptive Motion Energy Analysis for Facial Expression Recognition
In this paper, we present a facial expression recognition method using feature-adaptive motion energy analysis. Our method is simplicityoriented and avoids complicated face model r...
Sungkyu Noh, Hanhoon Park, Yoonjong Jin, Jong-Il P...
133
Voted
FOCS
2005
IEEE
15 years 9 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
125
Voted
NPC
2005
Springer
15 years 9 months ago
A Greedy Algorithm for Capacity-Constrained Surrogate Placement in CDNs
One major factor that heavily affects the performance of a content distribution network (CDN) is placement of the surrogates. Previous works take a network-centric approach and con...
Yifeng Chen, Yanxiang He, Jiannong Cao, Jie Wu
129
Voted
AAAI
2006
15 years 5 months ago
Targeting Specific Distributions of Trajectories in MDPs
We define TTD-MDPs, a novel class of Markov decision processes where the traditional goal of an agent is changed from finding an optimal trajectory through a state space to realiz...
David L. Roberts, Mark J. Nelson, Charles Lee Isbe...
138
Voted
IPL
2002
118views more  IPL 2002»
15 years 3 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...