Sciweavers

2079 search results - page 405 / 416
» Universality of random graphs
Sort
View
94
Voted
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
15 years 6 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 5 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
INFOCOM
2006
IEEE
15 years 5 months ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
102
Voted
MM
2006
ACM
218views Multimedia» more  MM 2006»
15 years 5 months ago
SmartLabel: an object labeling tool using iterated harmonic energy minimization
Labeling objects in images is an essential prerequisite for many visual learning and recognition applications that depend on training data, such as image retrieval, object detecti...
Wen Wu, Jie Yang
SIGMETRICS
2006
ACM
15 years 5 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph