Sciweavers

2814 search results - page 449 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 5 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
117
Voted
CVPR
2005
IEEE
16 years 2 months ago
A Statistical Field Model for Pedestrian Detection
This paper presents a new statistical model for detecting and tracking deformable objects such as pedestrians, where large shape variations induced by local shape deformation can ...
Ying Wu, Ting Yu, Gang Hua
DAC
2008
ACM
16 years 1 months ago
Partial order reduction for scalable testing of systemC TLM designs
A SystemC simulation kernel consists of a deterministic implementation of the scheduler, whose specification is nondeterministic. To leverage testing of a SystemC TLM design, we f...
Sudipta Kundu, Malay K. Ganai, Rajesh Gupta
190
Voted
ICDT
2009
ACM
109views Database» more  ICDT 2009»
16 years 1 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
112
Voted
MOBIHOC
2008
ACM
16 years 8 days ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer