Sciweavers

656 search results - page 100 / 132
» Marrying Words and Trees
Sort
View
VLDB
2008
ACM
110views Database» more  VLDB 2008»
16 years 1 days ago
Enhancing histograms by tree-like bucket indices
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
Francesco Buccafurri, Gianluca Lax, Domenico SaccÃ...
ASIAMS
2007
IEEE
15 years 6 months ago
Rough-Fuzzy Granulation, Rough Entropy and Image Segmentation
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
Sankar K. Pal
FOCS
2009
IEEE
15 years 3 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
APSEC
2001
IEEE
15 years 3 months ago
Orchestrating Computations on the World-Wide Web
Word processing software, email, and spreadsheet have revolutionized office activities. There are many other office tasks that are amenable to automation, such as: scheduling a vi...
Jayadev Misra, Harrick M. Vin
NLP
2000
15 years 3 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman