10608 search results - page 1717 / 2122 » Complexity of O'Hara's Algorithm |
115
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
A wealth of information is available only in web pages, patents, publications etc. Extracting information from such sources is challenging, both due to the typically complex langu...
99
Voted
KDD
2009
ACM
15 years 7 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
105
Voted
LATA
2009
Springer
15 years 7 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
104
click to vote
COMPSAC
2009
IEEE
15 years 7 months ago
2009
IEEE
— This paper presents the architecture, design and implementation of an email server that runs on a bare PC without an operating system or hard-disk. In addition to providing sta...
95
Voted
CSMR
2009
IEEE
15 years 7 months ago
2009
IEEE
It is important to focus on security aspects during the development cycle to deliver reliable software. However, locating security faults in complex systems is difficult and ther...