Sciweavers

62 search results - page 10 / 13
» Closed k-stop distance in graphs
Sort
View
WAW
2009
Springer
147views Algorithms» more  WAW 2009»
14 years 2 months ago
A Dynamic Model for On-Line Social Networks
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat...
BMCBI
2005
121views more  BMCBI 2005»
13 years 7 months ago
Automated methods of predicting the function of biological sequences using GO and BLAST
Background: With the exponential increase in genomic sequence data there is a need to develop automated approaches to deducing the biological functions of novel sequences with hig...
Craig E. Jones, Ute Baumann, Alfred L. Brown
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
14 years 1 months ago
Route skyline queries: A multi-preference path planning approach
— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects bein...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...
AGILE
2009
Springer
210views GIS» more  AGILE 2009»
14 years 2 months ago
Detecting Hotspots in Geographic Networks
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson,...