Sciweavers

967 search results - page 111 / 194
» Building a Calculus of Data Structures
Sort
View
COMCOM
2007
82views more  COMCOM 2007»
13 years 7 months ago
On application-level load balancing in FastReplica
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
Jangwon Lee, Gustavo de Veciana
IJDET
2010
123views more  IJDET 2010»
13 years 5 months ago
An Adaptive Course Generation Framework
: Existing adaptive e-learning methods are supported by student (user) profiling for capturing student characteristics, and course structuring for organizing learning materials acc...
Frederick W. B. Li, Rynson W. H. Lau, Parthiban Dh...
EDBT
2004
ACM
172views Database» more  EDBT 2004»
14 years 8 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
ICASSP
2009
IEEE
14 years 2 months ago
A study on multilingual acoustic modeling for large vocabulary ASR
We study key issues related to multilingual acoustic modeling for automatic speech recognition (ASR) through a series of large-scale ASR experiments. Our study explores shared str...
Hui Lin, Li Deng, Dong Yu, Yifan Gong, Alex Acero,...
ICCSA
2007
Springer
14 years 2 months ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi