494 search results - page 28 / 99 » Heap Building Bounds |
146
click to vote
SAS
2009
Springer
16 years 4 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
206
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
112
click to vote
DASFAA
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
122
click to vote
IJCAI
1993
15 years 5 months ago
1993
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
167
click to vote
SAC
2003
ACM
15 years 9 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...