Sciweavers

2254 search results - page 363 / 451
» Computing the minimal covering set
Sort
View
RECOMB
1997
Springer
15 years 10 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
SIGMOD
1997
ACM
131views Database» more  SIGMOD 1997»
15 years 10 months ago
Maintenance of Data Cubes and Summary Tables in a Warehouse
Data warehouses contain large amounts of information, often collected from a variety of independent sources. Decision-support functions in a warehouse, such as on-line analytical ...
Inderpal Singh Mumick, Dallan Quass, Barinderpal S...
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
15 years 3 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
VIS
2005
IEEE
146views Visualization» more  VIS 2005»
16 years 7 months ago
View Selection for Volume Rendering
In a visualization of a three-dimensional dataset, the insights gained are dependent on what is occluded and what is not. Suggestion of interesting viewpoints can improve both the...
Udeepta Bordoloi, Han-Wei Shen
170
Voted
KDD
2004
ACM
179views Data Mining» more  KDD 2004»
16 years 6 months ago
1-dimensional splines as building blocks for improving accuracy of risk outcomes models
Transformation of both the response variable and the predictors is commonly used in fitting regression models. However, these transformation methods do not always provide the maxi...
David S. Vogel, Morgan C. Wang