Sciweavers

253 search results - page 17 / 51
» Edge and Node Searching Problems on Trees
Sort
View
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
15 years 10 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
CORR
2008
Springer
121views Education» more  CORR 2008»
14 years 9 months ago
The Forgiving Tree: A Self-Healing Distributed Data Structure
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up t...
Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Treh...
CVPR
2008
IEEE
15 years 11 months ago
Global pose estimation using non-tree models
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...
Hao Jiang, David R. Martin
INFOCOM
2003
IEEE
15 years 3 months ago
Minimum Power Broadcast Trees for Wireless Networks: Integer Programming Formulations
— Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all...
Arindam Kumar Das
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
15 years 11 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...