1160 search results - page 7 / 232 » Revisiting the Sequence Constraint |
118
click to vote
BIRTHDAY
2005
Springer
15 years 7 months ago
2005
Springer
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
106
Voted
NETWORKING
2008
15 years 3 months ago
2008
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
123
click to vote
PODS
2008
ACM
16 years 1 months ago
2008
ACM
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...
89
Voted
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
Abstract. Given the projection of a su cient numberof points it is possible to algebraically eliminate the camera parameters and obtain viewinvariant functions of image coordinates...
185
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper we introduce new notions of k-type anonymizations. Those notions achieve similar privacy goals as those aimed by Sweenie and Samarati when proposing the concept of k-...