Sciweavers

99 search results - page 2 / 20
» Quantifier structure in search based procedures for QBFs
Sort
View
IPPS
2007
IEEE
14 years 9 days ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya
WWW
2008
ACM
14 years 6 months ago
Pagerank for product image search
In this paper, we cast the image-ranking problem into the task of identifying "authority" nodes on an inferred visual similarity graph and propose an algorithm to analyz...
Yushi Jing, Shumeet Baluja
ECCV
2004
Springer
14 years 8 months ago
Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Inherent Limitations
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
Tamar Avraham, Michael Lindenbaum
EURONGI
2008
Springer
13 years 7 months ago
Performance Evaluation of Overlay-Based Range Queries in Mobile Systems
Current mobility management systems are operator centralized, and focused on single link technologies. In heterogeneous wireless mesh networks, vertical handovers could be a length...
Amine M. Houyou, Alexander Stenzer, Hermann de Mee...
PAMI
2006
146views more  PAMI 2006»
13 years 6 months ago
Attention-Based Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Bounds
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...
Tamar Avraham, Michael Lindenbaum