14158 search results - page 2733 / 2832 » Generalized switch-setting problems |
143
click to vote
DDEP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
151
Voted
DEXA
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
129
Voted
COMPUTE
2010
ACM
15 years 7 months ago
2010
ACM
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
130
click to vote
SACMAT
2010
ACM
15 years 7 months ago
2010
ACM
There has been increasing interest in automatic techniques for generating roles for role based access control, a process known as role mining. Most role mining approaches assume t...
119
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...