Sciweavers

2223 search results - page 275 / 445
» Multimedia structuring using trees
Sort
View
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
16 years 26 days ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
GLOBECOM
2007
IEEE
16 years 22 days ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
UAI
2008
15 years 7 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
PAMI
2008
170views more  PAMI 2008»
15 years 6 months ago
Unsupervised Category Modeling, Recognition, and Segmentation in Images
Suppose a set of arbitrary (unlabeled) images contains frequent occurrences of 2D objects from an unknown category. This paper is aimed at simultaneously solving the following rel...
Sinisa Todorovic, Narendra Ahuja
DEXA
2010
Springer
187views Database» more  DEXA 2010»
15 years 4 months ago
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...