Sciweavers

4745 search results - page 405 / 949
» Discretization: An Enabling Technique
Sort
View
COMPGEOM
2006
ACM
16 years 24 days ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
CIKM
2009
Springer
15 years 11 months ago
Probabilistic skyline queries
The ability to deal with uncertain information is becoming increasingly important for modern database applications. Whereas a conventional (certain) object is usually represented ...
Christian Böhm, Frank Fiedler, Annahita Oswal...
ICCS
2001
Springer
15 years 11 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow
LSSC
2001
Springer
15 years 11 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
219
Voted
ECMAST
1998
Springer
118views Multimedia» more  ECMAST 1998»
15 years 11 months ago
Error-Robustness of Polar Contour-Coding
For communication using digital video, compression is mandatory because of the high bit-rate requiring a large bandwidth or storage capacity. Recent developments as well as upcomi...
Frank H. P. Spaan, Reginald L. Lagendijk, Jan Biem...