879 search results - page 105 / 176 » Designing Closer to the Edge |
160
Voted
PCM
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we propose a robust text segmentation method in complex background. The proposed method first utilizes the K-means algorithm to decompose a detected text block into ...
155
Voted
GD
2004
Springer
15 years 11 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
175
click to vote
IV
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper describes a radial layout method for displaying B+ -tree data structures. We present an algorithmic framework for computing the node positions that result in a planar d...
148
click to vote
P2P
2002
IEEE
15 years 11 months ago
2002
IEEE
In most peer-to-peer systems, edge resources self-organize into overlay networks. At the core of Freenet-style peer-to-peer systems are insert and request algorithms that dynamica...
198
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
In a paper that considered arithmetic precision as a limited resource in the design and analysis of algorithms, Liotta, Preparata and Tamassia defined an “implicit Voronoi diagr...