3360 search results - page 232 / 672 » Opportunistic Data Structures with Applications |
142
click to vote
CP
2004
Springer
15 years 8 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...
132
click to vote
HPCN
1997
Springer
15 years 8 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 ...
152
click to vote
ERSHOV
2006
Springer
15 years 8 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...
125
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
156
click to vote
WWW
2006
ACM
16 years 5 months ago
2006
ACM
Compared with traditional association rule mining in the structured world (e.g. Relational Databases), mining from XML data is confronted with more challenges due to the inherent ...