Sciweavers

337 search results - page 67 / 68
» An Anytime Algorithm for Decision Making under Uncertainty
Sort
View
FOCS
2009
IEEE
14 years 1 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
ICC
2008
IEEE
126views Communications» more  ICC 2008»
14 years 22 days ago
Discovering Packet Structure through Lightweight Hierarchical Clustering
— The complexity of current Internet applications makes the understanding of network traffic a challenging task. By providing larger-scale aggregates for analysis, unsupervised ...
Abdulrahman Hijazi, Hajime Inoue, Ashraf Matrawy, ...
ICCV
2005
IEEE
13 years 12 months ago
Perceptual Scale Space and its Applications
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...
Yizhou Wang, Siavosh Bahrami, Song Chun Zhu
MM
2003
ACM
239views Multimedia» more  MM 2003»
13 years 11 months ago
Foreground object detection from videos containing complex background
This paper proposes a novel method for detection and segmentation of foreground objects from a video which contains both stationary and moving background objects and undergoes bot...
Liyuan Li, Weimin Huang, Irene Y. H. Gu, Qi Tian
ICCAD
1999
IEEE
81views Hardware» more  ICCAD 1999»
13 years 10 months ago
Modeling design constraints and biasing in simulation using BDDs
Constraining and input biasing are frequently used techniques in functional verification methodologies based on randomized simulation generation. Constraints confine the simulatio...
Jun Yuan, Kurt Shultz, Carl Pixley, Hillel Miller,...