Sciweavers

1247 search results - page 200 / 250
» A Generalization of Jumps and Labels
Sort
View
MST
2010
111views more  MST 2010»
14 years 8 months ago
Sturmian Trees
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
Jean Berstel, Luc Boasson, Olivier Carton, Isabell...
PROCEDIA
2010
80views more  PROCEDIA 2010»
14 years 8 months ago
Visualising spins and clusters in regular and small-world Ising models with GPUs
Visualising computational simulation models of solid state physical systems is a hard problem for dense lattice models. Fly throughs and cutaways can aid viewer understanding of a...
Arno Leist, Daniel P. Playne, Kenneth A. Hawick
PVLDB
2010
121views more  PVLDB 2010»
14 years 8 months ago
Personalized Privacy Protection in Social Networks
Due to the popularity of social networks, many proposals have been proposed to protect the privacy of the networks. All these works assume that the attacks use the same background...
Mingxuan Yuan, Lei Chen 0002, Philip S. Yu
TSD
2010
Springer
14 years 8 months ago
Towards an N-Version Dependency Parser
Abstract. Maltparser is a contemporary dependency parsing machine learningbased system that shows great accuracy. However 90% for Labelled Attachment Score (LAS) seems to be a de f...
Miguel Ballesteros, Jesús Herrera, Virginia...
CC
2010
Springer
282views System Software» more  CC 2010»
14 years 8 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks