2173 search results - page 121 / 435 » On the Values of Reducibility Candidates |
IWC
2000
14 years 9 months ago
2000
Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms w...
JCT
2010
14 years 8 months ago
2010
In 1978, Chv´atal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest...
ISLPED
2005
ACM
15 years 3 months ago
2005
ACM
This paper proposes a non-uniform cache architecture for reducing the power consumption of memory systems. The nonuniform cache allows having different associativity values (i.e.,...
IDEAS
2006
IEEE
15 years 4 months ago
2006
IEEE
Unlike numerical preferences, preferences on attribute values do not show an inherent total order, but skyline computation has to rely on partial orderings explicitly stated by th...
ICSM
2009
IEEE
15 years 4 months ago
2009
IEEE
Modeling the navigation structure of a dynamic web application is a challenging task because of the presence of dynamic pages. In particular, there are two problems to be dealt wi...