Sciweavers

2229 search results - page 409 / 446
» Comparative analysis of biclustering algorithms
Sort
View
AND
2009
13 years 5 months ago
Accessing the content of Greek historical documents
In this paper, we propose an alternative method for accessing the content of Greek historical documents printed during the 17th and 18th centuries by searching words directly in d...
Anastasios L. Kesidis, Eleni Galiotou, Basilios Ga...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 2 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
14 years 1 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
CVPR
2009
IEEE
1626views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Coded Exposure Deblurring: Optimized Codes for PSF Estimation and Invertibility
We consider the problem of single image object motion deblurring from a static camera. It is well known that deblurring of moving objects using a traditional camera is ill-posed, d...
Amit K. Agrawal, Yi Xu
DAC
2003
ACM
14 years 8 months ago
Using estimates from behavioral synthesis tools in compiler-directed design space exploration
This paper considers the role of performance and area estimates from behavioral synthesis in design space exploration. We have developed a compilation system that automatically ma...
Byoungro So, Pedro C. Diniz, Mary W. Hall