359 search results - page 56 / 72 » Order Scheduling Models: Hardness and Algorithms |
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
122
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
185
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
In this paper we present a method for reformulating the Recommender Systems problem in an Information Retrieval one. In our tests we have a dataset of users who give ratings for s...
113
click to vote
DRM
2007
Springer
15 years 6 months ago
2007
Springer
In software protection we typically have to deal with the white-box attack model. In this model an attacker is assumed to have full access to the software and full control over it...
99
Voted
ICSE
2004
IEEE-ACM
15 years 12 months ago
2004
IEEE-ACM
Immersive, interactive applications grouped under the concept of Immersipresence require on-line processing and mixing of multimedia data streams and structures. One critical issu...