Sciweavers

243 search results - page 5 / 49
» Small Is Not Always Beautiful
Sort
View
OPODIS
2007
13 years 9 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...
SPAA
2010
ACM
14 years 20 days ago
Parallel approximation algorithms for facility-location problems
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
Guy E. Blelloch, Kanat Tangwongsan
JCT
2007
111views more  JCT 2007»
13 years 7 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
SIGMOD
2011
ACM
279views Database» more  SIGMOD 2011»
12 years 10 months ago
MOBIES: mobile-interface enhancement service for hidden web database
Many web databases are hidden behind form-based interfaces which are not always easy-to-use on mobile devices because of limitations such as small screen sizes, trickier text entr...
Xin Jin, Aditya Mone, Nan Zhang 0004, Gautam Das
BMCBI
2002
120views more  BMCBI 2002»
13 years 7 months ago
tacg - a grep for DNA
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
Harry Mangalam