Sciweavers

390 search results - page 61 / 78
» Approximate Query Answering in Locally Closed Databases
Sort
View
PODS
2008
ACM
178views Database» more  PODS 2008»
15 years 10 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 1 months ago
Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN
Many websites with a large user base, e.g., websites of nonprofit organizations, do not have the financial means to install large web-servers or use specialized content distributi...
Manal El Dick, Esther Pacitti, Bettina Kemme
ICVGIP
2004
14 years 11 months ago
Local Correlation-based Fingerprint Matching
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...
Karthik Nandakumar, Anil K. Jain
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
14 years 9 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila
IJCNN
2000
IEEE
15 years 2 months ago
Piecewise Linear Homeomorphisms: The Scalar Case
The class of piecewise linear homeomorphisms (PLH) provides a convenient functional representation for many applications wherein an approximation to data is required that is inver...
Richard E. Groff, Daniel E. Koditschek, Pramod P. ...