Sciweavers

500 search results - page 32 / 100
» Asynchronous Search with Aggregations
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
A general proof of convergence for adaptive distributed beamforming schemes
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework....
Chang-Ching Chen, Chia-Shiang Tseng, Che Lin
JAIR
2008
110views more  JAIR 2008»
13 years 8 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
WEBDB
2005
Springer
102views Database» more  WEBDB 2005»
14 years 1 months ago
Design and Implementation of a Geographic Search Engine
In this paper, we describe the design and initial implementation of a geographic search engine prototype for Germany, based on a large crawl of the de domain. Geographic search en...
Alexander Markowetz, Yen-Yu Chen, Torsten Suel, Xi...
PET
2012
Springer
11 years 10 months ago
PRISM - Privacy-Preserving Search in MapReduce
We present PRISM, a privacy-preserving scheme for word search in cloud computing. In the face of a curious cloud provider, the main challenge is to design a scheme that achieves pr...
Erik-Oliver Blass, Roberto Di Pietro, Refik Molva,...
CIKM
2008
Springer
13 years 10 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...