19866 search results - page 333 / 3974 » Computing all factorizations in *** |
159
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
147
click to vote
AVI
2008
15 years 9 months ago
2008
Pointing on screen edges is a frequent task in our everyday use of computers. Screen edges can help stop cursor movements, requiring less precise movements from the user. Thus, po...
232
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
196
click to vote
PDPTA
2007
15 years 8 months ago
2007
Abstract - We have experienced in our distributed applications that the network is the main limiting factor for performances on clusters. Indeed clusters are cheap and it is easier...
221
click to vote
AVI
2006
15 years 8 months ago
2006
In previous work, we proposed ValueCharts, a set of visualizations and interactive techniques to support the inspection of linear models of preferences. We now identify the need t...