4377 search results - page 575 / 876 » Mass problems and randomness |
175
click to vote
MMB
2004
Springer
16 years 2 days ago
2004
Springer
Rate measurements are required for many purposes, e.g. for system analysis and modelling or for live systems that react to measurements. For off-line measurement all data is avail...
194
click to vote
VLDB
2004
ACM
16 years 2 days ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
160
click to vote
GLVLSI
2003
IEEE
16 years 20 hour ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
153
click to vote
ICRA
2003
IEEE
16 years 13 hour ago
2003
IEEE
- Moving a crowd of robots or avatars from their current configurations to some destination area without causing collisions is a challenging motion-planning problem because the hig...
184
click to vote
INFOVIS
2003
IEEE
16 years 11 hour ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...