Sciweavers

727 search results - page 65 / 146
» Private approximation of search problems
Sort
View
CCCG
2008
13 years 11 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 9 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
FOCS
2007
IEEE
14 years 4 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
ICALP
2009
Springer
14 years 10 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang
WASA
2009
Springer
126views Algorithms» more  WASA 2009»
14 years 4 months ago
Data Collection with Multiple Sinks in Wireless Sensor Networks
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Ki...