Sciweavers

158 search results - page 23 / 32
» A Self-stabilizing Algorithm for Graph Searching in Trees
Sort
View
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
15 years 4 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...
CIKM
2005
Springer
15 years 3 months ago
Interconnection semantics for keyword search in XML
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they corr...
Sara Cohen, Yaron Kanza, Benny Kimelfeld, Yehoshua...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
15 years 9 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
WWW
2005
ACM
15 years 10 months ago
Partitioning of Web graphs by community topology
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
15 years 3 months ago
A multi-objective approach for the prediction of loan defaults
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
Oluwarotimi Odeh, Praveen Koduru, Sanjoy Das, Alle...