Sciweavers

1920 search results - page 252 / 384
» The Complexity of the A B C Problem
Sort
View
LOGCOM
2010
120views more  LOGCOM 2010»
15 years 22 days ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
SIGCOMM
2012
ACM
13 years 8 months ago
AutoNetkit: simplifying large scale, open-source network experimentation
We present a methodology that brings simplicity to large and comt labs by using abstraction. The networking community has appreciated the value of large scale test labs to explore...
Simon Knight, Askar Jaboldinov, Olaf Maennel, Iain...
CVPR
2000
IEEE
16 years 8 months ago
Fluid Structure and Motion Analysis from Multi-spectrum 2D Cloud Image Sequences
In this paper we present a novel approach to estimate and analyze 3D uid structure and motion of clouds from multi-spectrum 2D cloud image sequences. Accurate cloud-top structure ...
Lin Zhou, Chandra Kambhamettu, Dmitry B. Goldgof
CVPR
2003
IEEE
16 years 8 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath
CVPR
2004
IEEE
16 years 8 months ago
Sharing Features: Efficient Boosting Procedures for Multiclass Object Detection
We consider the problem of detecting a large number of different object classes in cluttered scenes. Traditional approaches require applying a battery of different classifiers to ...
Antonio B. Torralba, Kevin P. Murphy, William T. F...