Sciweavers

2801 search results - page 430 / 561
» On the Adequateness of the Connection Method
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
FOCS
2009
IEEE
15 years 4 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
ICDAR
2009
IEEE
15 years 4 months ago
Segmentation of Arabic Handwriting Based on both Contour and Skeleton Segmentation
We propose a new algorithm for segmentation of off-line handwritten Arabic words. The algorithm segments the connected letters to smaller segments each of which contains no more t...
Safwan Wshah, Zhixin Shi, Venu Govindaraju
ICNP
2009
IEEE
15 years 4 months ago
Topological Detection on Wormholes in Wireless Ad Hoc and Sensor Networks
—Wormhole attack is a severe threat to wireless ad hoc and sensor networks. Most existing countermeasures either require specialized hardware devices or make strong assumptions o...
Dezun Dong, Mo Li, Yunhao Liu, Xiang-Yang Li, Xian...
ICSM
2009
IEEE
15 years 4 months ago
BCC: Enhancing code completion for better API usability
Nowadays, programmers spend much of their workday dealing with code libraries and frameworks that are bloated with APIs. One common way of interacting with APIs is through Code Co...
David M. Pletcher, Daqing Hou