Sciweavers

1016 search results - page 191 / 204
» Generalized distances between rankings
Sort
View
ICCV
2005
IEEE
14 years 3 months ago
Surface Parameterization Using Riemann Surface Structure
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
Yalin Wang, Xianfeng Gu, Kiralee M. Hayashi, Tony ...
SIGMETRICS
2003
ACM
165views Hardware» more  SIGMETRICS 2003»
14 years 3 months ago
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
Stephan Bohacek, João P. Hespanha, Junsoo L...
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
14 years 2 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
FOCS
2000
IEEE
14 years 2 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
OA
1989
237views Algorithms» more  OA 1989»
14 years 2 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph