3020 search results - page 377 / 604 » Optimal partition trees |
147
click to vote
ICCBR
2003
Springer
15 years 11 months ago
2003
Springer
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
176
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
147
click to vote
DCC
2000
IEEE
15 years 11 months ago
2000
IEEE
We introduce a new image compression algorithm that allows progressive image reconstruction – both in resolution and in fidelity, with a fully embedded bitstream. The algorithm ...
190
click to vote
MOBICOM
1997
ACM
15 years 10 months ago
1997
ACM
We describe a reliable broadcast protocol for mobile multihop packet radio networks. The reliable broadcast service ensures that all the hosts in a group deliver the same set of m...
157
click to vote
CIKM
1994
Springer
15 years 10 months ago
1994
Springer
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...