Sciweavers

2079 search results - page 164 / 416
» Research Problems in Data Warehousing
Sort
View
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
14 years 11 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
METMBS
2004
162views Mathematics» more  METMBS 2004»
14 years 11 months ago
A Comparison of DNA Fragment Assembly Algorithms
As more research centers embark on sequencing new genomes, the problem of DNA fragment assembly for shotgun sequencing is growing in importance and complexity. Accurate and fast a...
Lishan Li, Sami Khuri
83
Voted
VMV
2001
86views Visualization» more  VMV 2001»
14 years 11 months ago
Segmentation of Range Images through the Integration of Different Strate Gies
Segmentation of range images has long been considered an important and difficult problem and continues to attract the attention of researchers in computer vision. In this paper we...
Mary Ellen Bock, Concettina Guerra
ECOOP
1998
Springer
15 years 2 months ago
The Complexity of Type Analysis of Object Oriented Programs
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
Joseph Gil, Alon Itai
90
Voted
DKE
2006
157views more  DKE 2006»
14 years 10 months ago
XML structural delta mining: Issues and challenges
Recently, there is an increasing research efforts in XML data mining. These research efforts largely assumed that XML documents are static. However, in reality, the documents are ...
Qiankun Zhao, Ling Chen 0002, Sourav S. Bhowmick, ...