Sciweavers

706 search results - page 90 / 142
» Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Sort
View
ICDE
2007
IEEE
178views Database» more  ICDE 2007»
14 years 10 months ago
Efficient Skyline Query Processing on Peer-to-Peer Networks
Skyline query has been gaining much interest in database research communities in recent years. Most existing studies focus mainly on centralized systems, and resolving the problem...
Shiyuan Wang, Beng Chin Ooi, Anthony K. H. Tung, L...
MST
2010
155views more  MST 2010»
13 years 3 months ago
Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks
We consider the important problem of energy balanced data propagation in wireless sensor networks and we extend and generalize previous works by allowing adaptive energy assignment...
Pierre Leone, Sotiris E. Nikoletseas, José ...
CIMCA
2006
IEEE
14 years 2 months ago
A Junction Based Segmentation Algorithm for Offline Handwritten Connected Character Segmentation
A junction based approach for Segmenting and recognizing offline handwritten connected twodigit strings is presented in this paper. Very often even in a printed text, adjacent cha...
U. K. S. Jayarathna, G. E. M. D. C. Bandara
BIRTHDAY
2011
Springer
12 years 8 months ago
Algorithmic Aspects of Risk Management
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
Ashish Gehani, Lee Zaniewski, K. Subramani
UAI
2004
13 years 10 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes