Sciweavers

1461 search results - page 234 / 293
» Complexity of Graph Covering Problems
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
Arun Sridharan, Can Emre Koksal, Elif Uysal-Biyiko...
ICCV
1999
IEEE
14 years 10 months ago
Curve Finder Combining Perceptual Grouping and a Kalman Like Fitting
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
Frederic Guichard, Jean-Philippe Tarel
ICPR
2010
IEEE
14 years 3 months ago
Integrating a Discrete Motion Model into GMM Based Background Subtraction
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
Christian Wolf, Jolion Jolion
WIAMIS
2009
IEEE
14 years 3 months ago
Graph-based approach for 3D object duplicate detection
In this paper, we consider the challenging problem of object duplicate detection and localization. Several applications require efficient object duplicate detection methods, such ...
Peter Vajda, Frédéric Dufaux, Thien ...
ISPDC
2008
IEEE
14 years 3 months ago
FPGA Implementations of a Parallel Associative Processor with Multi-Comparand Multi-Search Operations
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
Zbigniew Kokosinski, Bartlomiej Malus