Sciweavers

2080 search results - page 191 / 416
» Measuring empirical computational complexity
Sort
View
ICIP
2005
IEEE
16 years 6 months ago
Expression-invariant face recognition via spherical embedding
Recently, it was proven empirically that facial expressions can be modelled as isometries, that is, geodesic distances on the facial surface were shown to be significantly less se...
Alexander M. Bronstein, Michael M. Bronstein, Ron ...
ICPR
2004
IEEE
16 years 6 months ago
Selective Sampling Based on the Variation in Label Assignments
In this paper, a new selective sampling method for the active learning framework is presented. Initially, a small training set ? and a large unlabeled set ? are given. The goal is...
Piotr Juszczak, Robert P. W. Duin
CHI
2008
ACM
16 years 5 months ago
The cost of interrupted work: more speed and stress
We performed an empirical study to investigate whether the context of interruptions makes a difference. We found that context does not make a difference but surprisingly, people c...
Gloria Mark, Daniela Gudith, Ulrich Klocke
ICNSC
2008
IEEE
15 years 11 months ago
Cscan: A Correlation-based Scheduling Algorithm for Wireless Sensor Networks
— Dynamic scheduling management in wireless sensor networks is one of the most challenging problems in long lifetime monitoring applications. In this paper, we propose and evalua...
Qingquan Zhang, Yu Gu, Tian He, Gerald E. Sobelman
AINA
2007
IEEE
15 years 11 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein