Sciweavers

840 search results - page 166 / 168
» The Complexity of the Extended GCD Problem
Sort
View
ENTCS
2007
153views more  ENTCS 2007»
13 years 7 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
SIGIR
2008
ACM
13 years 7 months ago
A simple and efficient sampling method for estimating AP and NDCG
We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge te...
Emine Yilmaz, Evangelos Kanoulas, Javed A. Aslam
TIP
2008
153views more  TIP 2008»
13 years 7 months ago
Generalized Flooding and Multicue PDE-Based Image Segmentation
Image segmentation remains an important, but hard-to-solve, problem since it appears to be application dependent with usually no a priori information available regarding the image ...
Anastasia Sofou, Petros Maragos
GEOINFORMATICA
1998
125views more  GEOINFORMATICA 1998»
13 years 7 months ago
Computational Perspectives on Map Generalization
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...
Robert Weibel, Christopher B. Jones
CCR
1999
92views more  CCR 1999»
13 years 7 months ago
YESSIR: a simple reservation mechanism for the Internet
Abstract-RSVP has been designed to support resource reservation in the Internet. However, it has two major problems: complexity and scalability. The former results in large message...
Ping Pan, Henning Schulzrinne