4850 search results - page 419 / 970 » Approximate Data Structures with Applications |
152
click to vote
ADBIS
2003
Springer
16 years 4 days ago
2003
Springer
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
289
click to vote
BIBE
2004
IEEE
15 years 10 months ago
2004
IEEE
There is a recognized need for a meta-classification that can serve as a foundation for more refined ontologies in the field of proteomics. Standard data sources classify proteins...
189
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
171
click to vote
HPCN
1997
Springer
15 years 10 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
210
click to vote
ERSHOV
2006
Springer
15 years 10 months ago
2006
Springer
A new coordination language for distributed data-parallel programs is presented, call SNet. The intention of SNet is to introduce advanced structuring techniques into a coordinatio...