Sciweavers

4926 search results - page 763 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ICML
2007
IEEE
14 years 9 months ago
Fast and effective kernels for relational learning from texts
In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such mode...
Alessandro Moschitti, Fabio Massimo Zanzotto
MMSEC
2006
ACM
129views Multimedia» more  MMSEC 2006»
14 years 2 months ago
WLAN steganography: a first practical review
Two different approaches for constructing a steganographic channel in an IEEE 802.11 (WLAN) network are introduced in this paper. First test results on the reliability, undetectab...
Christian Krätzer, Jana Dittmann, Andreas Lan...
PODC
2009
ACM
14 years 8 months ago
Randomized mutual exclusion in O(log N / log log N) RMRs
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
Danny Hendler, Philipp Woelfel
SI3D
2003
ACM
14 years 1 months ago
Interactive visibility culling in complex environments using occlusion-switches
: We present occlusion-switches for interactive visibility culling in complex 3D environments. An occlusionswitch consists of two GPUs (graphics processing units) and each GPU is u...
Naga K. Govindaraju, Avneesh Sud, Sung-Eui Yoon, D...
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 8 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg