Sciweavers

5595 search results - page 942 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
145
Voted
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
16 years 3 months ago
On the Exact Space Complexity of Sketching and Streaming Small Norms
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
WSDM
2009
ACM
131views Data Mining» more  WSDM 2009»
16 years 1 months ago
Diversifying search results
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
ICB
2009
Springer
119views Biometrics» more  ICB 2009»
16 years 27 days ago
Multi-Region Probabilistic Histograms for Robust and Scalable Identity Inference
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
Conrad Sanderson, Brian C. Lovell
190
Voted
CEC
2008
IEEE
16 years 24 days ago
Auto-tuning fuzzy granulation for evolutionary optimization
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
Mohsen Davarynejad, Mohammad R. Akbarzadeh-Totonch...
IAT
2008
IEEE
16 years 24 days ago
Introducing Communication in Dis-POMDPs with Locality of Interaction
The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has ...
Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Y...