Sciweavers

288 search results - page 55 / 58
» Notes on computing minimal approximant bases
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 3 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
IDA
2002
Springer
13 years 9 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
IJCV
2008
209views more  IJCV 2008»
13 years 8 months ago
Motion and Appearance Nonparametric Joint Entropy for Video Segmentation
This paper deals with video segmentation based on motion and spatial information. Classically, the motion term is based on a motion compensation error (MCE) between two consecutiv...
Sylvain Boltz, Ariane Herbulot, Eric Debreuve, Mic...
TKDE
2011
472views more  TKDE 2011»
13 years 4 months ago
Anonymous Publication of Sensitive Transactional Data
Abstract—Existing research on privacy-preserving data publishing focuses on relational data: in this context, the objective is to enforce privacy-preserving paradigms, such as k-...
Gabriel Ghinita, Panos Kalnis, Yufei Tao
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
14 years 2 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...