373 search results - page 64 / 75 » Counting in Trees for Free |
HICSS
1999
IEEE
14 years 1 months ago
1999
IEEE
Assessing the reliability of a software system has always been an elusive target. A program may work very well for a number of years and this same program may suddenly become quit...
COMPGEOM
1992
ACM
14 years 24 days ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
Existing energy-efficient approaches to in-network aggregation in sensor networks can be classified into two categories, tree-based and multi-path-based, with each having unique s...