Sciweavers

1263 search results - page 219 / 253
» A* with Bounded Costs
Sort
View
DEXA
1995
Springer
126views Database» more  DEXA 1995»
13 years 11 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek
DBSEC
2010
101views Database» more  DBSEC 2010»
13 years 9 months ago
Generalizing PIR for Practical Private Retrieval of Public Data
Private retrieval of public data is useful when a client wants to query a public data service without revealing the specific query data to the server. Computational Private Informa...
Shiyuan Wang, Divyakant Agrawal, Amr El Abbadi
OPODIS
2003
13 years 9 months ago
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 8 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman