Sciweavers

2924 search results - page 499 / 585
» Lower Bounds in Distributed Computing
Sort
View
TSP
2010
14 years 11 months ago
Covariance estimation in decomposable Gaussian graphical models
Graphical models are a framework for representing and exploiting prior conditional independence structures within distributions using graphs. In the Gaussian case, these models are...
Ami Wiesel, Yonina C. Eldar, Alfred O. Hero
158
Voted
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 4 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 4 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
ICALP
2009
Springer
16 years 4 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
16 years 4 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...