Sciweavers

521 search results - page 78 / 105
» Coring method for clustering a graph
Sort
View
SAC
2009
ACM
15 years 11 months ago
Link-based event detection in email communication networks
People’s email communications can be modeled as graphs with vertices representing email accounts and edges representing email communications. Email communication data usually co...
Xiaomeng Wan, Evangelos E. Milios, Nauzer Kalyaniw...
SMI
2010
IEEE
188views Image Analysis» more  SMI 2010»
15 years 2 months ago
Sharp Feature Detection in Point Clouds
—This paper presents a new technique for detecting sharp features on point-sampled geometry. Sharp features of different nature and possessing angles varying from obtuse to acute...
Christopher Weber, Stefanie Hahmann, Hans Hagen
HM
2007
Springer
137views Optimization» more  HM 2007»
15 years 10 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
15 years 9 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...
MP
1998
136views more  MP 1998»
15 years 3 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...