Sciweavers

4277 search results - page 331 / 856
» On Multiple Linear Approximations
Sort
View
CPM
1998
Springer
115views Combinatorics» more  CPM 1998»
15 years 7 months ago
Aligning Alignments
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Weiqing Zhang
155
Voted
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 8 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
ECCV
1996
Springer
16 years 5 months ago
Euclidean Reconstruction: From Paraperspective to Perspective
In this paper we describe a method to perform Euclidean reconstruction with a perspective camera model. It incrementally performs reconstruction with a paraperspective camera in or...
Stéphane Christy, Radu Horaud
117
Voted
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 3 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
114
Voted
ISSAC
2009
Springer
121views Mathematics» more  ISSAC 2009»
15 years 10 months ago
Faster real feasibility via circuit discriminants
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
Frédéric Bihan, J. Maurice Rojas, Ca...