2168 search results - page 282 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
141
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
140
Voted
CIVR
2008
Springer
15 years 6 months ago
2008
Springer
Past research on automatic laughter detection has focused mainly on audio-based detection. Here we present an audiovisual approach to distinguishing laughter from speech and we sh...
175
click to vote
WISEC
2010
ACM
15 years 9 months ago
2010
ACM
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
163
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
The objective of this work is the detection of object classes, such as airplanes or horses. Instead of using a model based on salient image fragments, we show that object class det...
133
click to vote
SIGGRAPH
2000
ACM
15 years 8 months ago
2000
ACM
Approximating detailed models with coarse, texture-mapped meshes results in polygonal silhouettes. To eliminate this artifact, we introduce silhouette clipping, a framework for ef...