Sciweavers

1522 search results - page 113 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
WWW
2005
ACM
14 years 9 months ago
An experimental study on large-scale web categorization
Taxonomies of the Web typically have hundreds of thousands of categories and skewed category distribution over documents. It is not clear whether existing text classification tech...
Tie-Yan Liu, Yiming Yang, Hao Wan, Qian Zhou, Bin ...

Publication
222views
14 years 6 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
ICCAD
2002
IEEE
122views Hardware» more  ICCAD 2002»
14 years 6 months ago
Schedulability analysis of multiprocessor real-time applications with stochastic task execution times
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distrib...
Sorin Manolache, Petru Eles, Zebo Peng
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 3 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
SACRYPT
2009
Springer
150views Cryptology» more  SACRYPT 2009»
14 years 3 months ago
Information Theoretically Secure Multi Party Set Intersection Re-visited
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan