Sciweavers

2107 search results - page 236 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ISCI
2008
116views more  ISCI 2008»
13 years 9 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
FOCS
2010
IEEE
13 years 7 months ago
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...
Moritz Hardt, Guy N. Rothblum
CIDM
2009
IEEE
14 years 4 months ago
Large-scale attribute selection using wrappers
Abstract— Scheme-specific attribute selection with the wrapper and variants of forward selection is a popular attribute selection technique for classification that yields good ...
Martin Gutlein, Eibe Frank, Mark Hall, Andreas Kar...
IROS
2007
IEEE
189views Robotics» more  IROS 2007»
14 years 3 months ago
Differential evolution approach to the grid-based localization and mapping problem
— A new solution to the Simultaneous Localization and Modelling problem is presented. It is based on the stochastic search of solutions in the state space to the global localizat...
Luis Moreno, Santiago Garrido, Fernando Martin, Ma...
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
13 years 7 months ago
Multi-robot coordination with periodic connectivity
Abstract— We consider the problem of multi-robot coordination subject to constraints on the configuration. Specifically, we examine the case in which a mobile network of robots...
Geoffrey Hollinger, Sanjiv Singh