9949 search results - page 1655 / 1990 » On the Network Complexity of Selection |
320
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
304
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
177
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
The increased deployment of System-on-Chip designs has drawn attention to the limitations of on-chip interconnects. As a potential solution to these limitations, Networks-on -Chip...
188
click to vote
MICCAI
2007
Springer
16 years 7 months ago
2007
Springer
In functional connectivity analysis, networks of interest are defined based on correlation with the mean time course of a user-selected `seed' region. In this work we propose ...
172
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...