Sciweavers

185 search results - page 9 / 37
» A metric approach toward point process divergence
Sort
View
TASE
2010
IEEE
13 years 1 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
SIGOPSE
2004
ACM
14 years 13 days ago
An approach to benchmarking configuration complexity
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
Aaron B. Brown, Joseph L. Hellerstein
ESWS
2007
Springer
14 years 1 months ago
A Performance and Scalability Metric for Virtual RDF Graphs
Abstract. From a theoretical point of view, the Semantic Web is understood in terms of a stack with RDF being one of its layers. A Semantic Web application operates on the common d...
Michael Hausenblas, Wolfgang Slany, Danny Ayers
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 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
ICIP
2009
IEEE
14 years 7 months ago
Efficient Distance Estimation For Fitting Implicit Quadric Surfaces
This paper presents a novel approach for estimating the shortest Euclidean distance from a given point to the corresponding implicit quadric fitting surface. It first estimates t...
Angel D. Sappa, Mohammad Rouhani