Sciweavers

979 search results - page 98 / 196
» Issues in Developing Very Large Data Warehouses
Sort
View
DAGM
2009
Springer
15 years 7 months ago
A Gradient Descent Approximation for Graph Cuts
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
Alparslan Yildiz, Yusuf Sinan Akgul
TNN
2010
148views Management» more  TNN 2010»
15 years 21 days ago
A fast algorithm for robust mixtures in the presence of measurement errors
Abstract--In experimental and observational sciences, detecting atypical, peculiar data from large sets of measurements has the potential of highlighting candidates of interesting ...
Jianyong Sun, Ata Kabán
FOCS
2002
IEEE
15 years 11 months ago
Implicit B-Trees: New Results for the Dictionary Problem
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
Gianni Franceschini, Roberto Grossi, J. Ian Munro,...
PKDD
2004
Springer
102views Data Mining» more  PKDD 2004»
15 years 11 months ago
Improving the Performance of the RISE Algorithm
Ideally, a multi-strategy learning algorithm performs better than its component approaches. RISE is a multi-strategy algorithm that combines rule induction and instance-based learn...
Aloísio Carlos de Pina, Gerson Zaverucha
COLING
2008
15 years 7 months ago
Automatic Generation of Parallel Treebanks
The need for syntactically annotated data for use in natural language processing has increased dramatically in recent years. This is true especially for parallel treebanks, of whi...
Ventsislav Zhechev, Andy Way