Sciweavers

3108 search results - page 96 / 622
» The Elements of Computer Credibility
Sort
View
FOCS
1991
IEEE
15 years 8 months ago
Computing Sums of Radicals in Polynomial Time
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
Johannes Blömer
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 4 months ago
Space-Efficient Online Computation of Quantile Summaries
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
Michael Greenwald, Sanjeev Khanna
ADG
2006
Springer
177views Mathematics» more  ADG 2006»
15 years 10 months ago
Recognition of Computationally Constructed Loci
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
Peter Lebmeir, Jürgen Richter-Gebert
CBMS
2005
IEEE
15 years 10 months ago
Challenges of Ultra Large Scale Integration of Biomedical Computing Systems
The NCRI Informatics Initiative is overseeing the implementation of an informatics framework for the UK cancer research community. The framework advocates an integrated multidisci...
R. H. J. Begent, J. Michael Brady, Anthony Finkels...
ICMB
2005
IEEE
118views Business» more  ICMB 2005»
15 years 10 months ago
A Context-Sensitive Service Discovery Protocol for Mobile Computing Environments
Service discovery is important in mobile and pervasive computing environments, where the set of resources available to an entity changes dynamically over time. This paper describe...
Ricky Robinson, Jadwiga Indulska