1921 search results - page 270 / 385 » : Designing a Scalable Build Process |
114
click to vote
COR
2008
15 years 3 months ago
2008
In this paper we determine the optimal fraction c of the uplink channel capacity that should be dedicated to the contention channel in a DOCSIS cable network in order to minimize ...
163
Voted
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
123
Voted
ESAW
2000
Springer
15 years 7 months ago
2000
Springer
While software is becoming decomposed in more and more finegrained entities, the interactions amongst those become of major importance. While methodologies for building such compon...
134
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
237
Voted
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...