Sciweavers

2834 search results - page 269 / 567
» Representing Trees with Constraints
Sort
View
TON
2010
129views more  TON 2010»
15 years 5 months ago
QoS-based manycasting over optical burst-switched (OBS) networks
Abstract—Many distributed applications require a group of destinations to be coordinated with a single source. Multicasting is a communication paradigm to implement these distrib...
Balagangadhar G. Bathula, Vinod Vokkarane
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 7 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
16 years 1 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
EIT
2008
IEEE
16 years 1 months ago
Taming XML: Objects first, then markup
Abstract—Processing markup in object-oriented languages often requires the programmer to focus on the objects generating the markup rather than the more pertinent domain objects....
Matt Bone, Peter F. Nabicht, Konstantin Läufe...
NETGAMES
2006
ACM
16 years 17 days ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...