Sciweavers

7 search results - page 1 / 2
» Minimum sized text containment shapes
Sort
View
DOCENG
2006
ACM
13 years 10 months ago
Minimum sized text containment shapes
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
Nathan Hurst, Kim Marriott, Peter Moulder
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 4 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 6 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
ICDAR
2009
IEEE
13 years 11 months ago
A Gradient Difference Based Technique for Video Text Detection
Text detection in video images has received increasing attention, particularly in scene text detection in video images, as it plays a vital role in video indexing and information ...
Palaiahnakote Shivakumara, Trung Quy Phan, Chew Li...
AIPS
2003
13 years 6 months ago
Optimal Rectangle Packing: Initial Results
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
Richard E. Korf