Sciweavers

1445 search results - page 259 / 289
» XPath query containment
Sort
View
IUI
2010
ACM
14 years 4 months ago
DocuBrowse: faceted searching, browsing, and recommendations in an enterprise context
Browsing and searching for documents in large, online enterprise document repositories are common activities. While internet search produces satisfying results for most user queri...
Andreas Girgensohn, Frank M. Shipman III, Francine...
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 4 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
FOCS
2009
IEEE
14 years 4 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
ICDM
2007
IEEE
227views Data Mining» more  ICDM 2007»
14 years 4 months ago
Optimal Subsequence Bijection
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
Longin Jan Latecki, Qiang Wang, Suzan Koknar-Tezel...
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
Ueli M. Maurer, Stefano Tessaro