Sciweavers

12863 search results - page 2563 / 2573
» Dynamic Data Mining
Sort
View
113
Voted
TON
2010
129views more  TON 2010»
15 years 7 days 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
132
Voted
TVCG
2010
165views more  TVCG 2010»
15 years 7 days ago
A Visual Backchannel for Large-Scale Events
—We introduce the concept of a Visual Backchannel as a novel way of following and exploring online conversations about large-scale events. Microblogging communities, such as Twit...
Marian Dörk, Daniel M. Gruen, Carey Williamso...
135
Voted
EGH
2010
Springer
14 years 12 months ago
Parallel SAH k-D tree construction
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
153
Voted
EMNLP
2010
14 years 12 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...
IPPS
2010
IEEE
14 years 11 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
« Prev « First page 2563 / 2573 Last » Next »