Sciweavers

2310 search results - page 379 / 462
» Coloring Random Graphs
Sort
View
CN
2008
98views more  CN 2008»
13 years 8 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 8 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
AAAI
2012
11 years 10 months ago
Robust Cuts Over Time: Combatting the Spread of Invasive Species with Unreliable Biological Control
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
Gwen Spencer
CVPR
2007
IEEE
14 years 10 months ago
Multi-modal Clustering for Multimedia Collections
Most of the online multimedia collections, such as picture galleries or video archives, are categorized in a fully manual process, which is very expensive and may soon be infeasib...
Ron Bekkerman, Jiwoon Jeon
PODS
2001
ACM
127views Database» more  PODS 2001»
14 years 8 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor