7978 search results - page 706 / 1596 » Combining shared-coin algorithms |
158
click to vote
PAKDD
2004
ACM
16 years 24 days ago
2004
ACM
Abstract. Traditional clustering algorithms are based on one representation space, usually a vector space. However, in a variety of modern applications, multiple representations ex...
151
click to vote
PATMOS
2004
Springer
16 years 24 days ago
2004
Springer
This paper surveys different implementations of dividers on FPGA technology. A special attention is paid on ATP (area-time-power) trade-offs between restoring, non-restoring, and S...
179
click to vote
TIDSE
2004
Springer
16 years 23 days ago
2004
Springer
Achieving a successful Interactive Drama where the user can act as a character in the story requires not only finding an algorithmic solution for combining interactivity and narrat...
177
Voted
VLDB
2004
ACM
16 years 23 days ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
190
click to vote
WAW
2004
Springer
16 years 23 days ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...