5606 search results - page 822 / 1122 » Randomization Techniques for Graphs. |
254
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
202
click to vote
ALGOSENSORS
2009
Springer
16 years 1 months ago
2009
Springer
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
201
click to vote
CIBCB
2006
IEEE
16 years 1 months ago
2006
IEEE
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...
211
click to vote
PLDI
2006
ACM
16 years 1 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
241
click to vote
PLDI
2004
ACM
16 years 21 days ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...