Sciweavers

2283 search results - page 381 / 457
» Bounds of Graph Characteristics
Sort
View
MDM
2009
Springer
123views Communications» more  MDM 2009»
14 years 2 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
MODELS
2009
Springer
14 years 2 months ago
Feature-oriented programming with Ruby
Features identify core characteristics of software in order to produce families of programs. Through configuration, different variants of a program can be composed. Our approach...
Sebastian Günther, Sagar Sunkle
HT
2009
ACM
14 years 2 months ago
Hyperincident connected components of tagging networks
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
Nicolas Neubauer, Klaus Obermayer
ICDM
2008
IEEE
109views Data Mining» more  ICDM 2008»
14 years 2 months ago
Learning by Propagability
In this paper, we present a novel feature extraction framework, called learning by propagability. The whole learning process is driven by the philosophy that the data labels and o...
Bingbing Ni, Shuicheng Yan, Ashraf A. Kassim, Loon...
ICDCS
2007
IEEE
14 years 2 months ago
Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks
In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. ...
Hasan Guclu, Murat Yuksel