5144 search results - page 204 / 1029 » Enhancing Search with Structure |
185
Voted
LCN
2008
IEEE
16 years 1 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
145
click to vote
ENTCS
2002
15 years 6 months ago
2002
In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data struct...
188
Voted
CAISE
2003
Springer
16 years 8 days ago
2003
Springer
The proliferation of digital camera devices (stand-alone or combined with cell phones), new protocols such as MMS and the desire of people to communicate and share their experience...
145
Voted
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
A hyper-heuristic performs search over a set of other search mechanisms. During the search, it does not require any problem-dependent data. This structure makes hyperheuristics pro...
187
Voted
DOCENG
2004
ACM
16 years 14 days ago
2004
ACM
This paper describes a tool for recombining the logical structure from an XML document with the typeset appearance of the corresponding PDF document. The tool uses the XML represe...