Sciweavers

77 search results - page 15 / 16
» Robust Subgraphs for Trees and Paths
Sort
View
P2P
2009
IEEE
122views Communications» more  P2P 2009»
14 years 2 months ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 7 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
PODS
2006
ACM
88views Database» more  PODS 2006»
14 years 7 months ago
Structural characterizations of the semantics of XPath as navigation tool on a document
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of various fragments of XPath, the core navigational language on XML documents. We gi...
Marc Gyssens, Jan Paredaens, Dirk Van Gucht, Georg...
SCN
2011
Springer
348views Communications» more  SCN 2011»
13 years 2 months ago
MANET QoS support without reservations
An inelastic flow is a flow with inelastic rate: i.e., the rate is fixed, it cannot be dynamically adjusted to traffic and load condition as in elastic flows like TCP. Real ti...
Soon-Young Oh, Gustavo Marfia, Mario Gerla
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 7 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...