Sciweavers

6455 search results - page 821 / 1291
» Research problems
Sort
View
DKE
2007
199views more  DKE 2007»
15 years 6 months ago
QMatch - Using paths to match XML schemas
Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing ...
Naiyana Tansalarak, Kajal T. Claypool
SIAMREV
2010
114views more  SIAMREV 2010»
15 years 1 months ago
From Random Polygon to Ellipse: An Eigenanalysis
Suppose x and y are unit 2-norm n-vectors whose components sum to zero. Let P(x, y) be the polygon obtained by connecting (x1, y1), . . . , (xn, yn), (x1, y1) in order. We say that...
Adam N. Elmachtoub, Charles F. Van Loan
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
16 years 1 months ago
Finding Maximal Fully-Correlated Itemsets in Large Databases
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
Lian Duan, William Nick Street
INFOCOM
2008
IEEE
16 years 1 months ago
Algorithms for Low-Latency Remote File Synchronization
The remote file synchronization problem is how to update an outdated version of a file located on one machine to the current version located on another machine with a minimal am...
Hao Yan, Utku Irmak, Torsten Suel
EC
1998
112views ECommerce» more  EC 1998»
15 years 6 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley