Sciweavers

15494 search results - page 2682 / 3099
» Computing dynamic clusters
Sort
View
DKE
2010
167views more  DKE 2010»
15 years 4 months ago
Discovering private trajectories using background information
Trajectories are spatio-temporal traces of moving objects which contain valuable information to be harvested by spatio-temporal data mining techniques. Applications like city traf...
Emre Kaplan, Thomas Brochmann Pedersen, Erkay Sava...
AROBOTS
2011
15 years 1 months ago
Time-extended multi-robot coordination for domains with intra-path constraints
Abstract— Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect con...
Edward Gil Jones, M. Bernardine Dias, Anthony Sten...
BMCBI
2011
15 years 1 months ago
Detection of viral sequence fragments of HIV-1 subfamilies yet unknown
Background: Methods of determining whether or not any particular HIV-1 sequence stems - completely or in part - from some unknown HIV-1 subtype are important for the design of vac...
Thomas Unterthiner, Anne-Kathrin Schultz, Jan Bull...
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 1 months ago
On Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...
KAIS
2011
129views more  KAIS 2011»
15 years 1 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
« Prev « First page 2682 / 3099 Last » Next »