3136 search results - page 291 / 628 » Comparison of Clique-Listing Algorithms |
235
click to vote
ICOIN
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
142
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to ...
189
click to vote
TACAS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
172
Voted
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
We present and compare adaptive detection algorithms developed for synthetic aperture radar (SAR) targets in structured clutter, utilizing both generalized likelihood ratio (GLR) ...
170
click to vote
ICSM
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents an approach to build and visualize traceability links and properties of a set of OO software releases. The process recovers an "as is" design from C+...