Sciweavers

1452 search results - page 150 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
138
Voted
ICSE
2005
IEEE-ACM
16 years 2 months ago
Verification and change-impact analysis of access-control policies
Sensitive data are increasingly available on-line through the Web and other distributed protocols. This heightens the need to carefully control access to data. Control means not o...
Kathi Fisler, Shriram Krishnamurthi, Leo A. Meyero...
119
Voted
NN
2008
Springer
152views Neural Networks» more  NN 2008»
15 years 2 months ago
Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...
IPPS
2006
IEEE
15 years 8 months ago
Detecting phases in parallel applications on shared memory architectures
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
Erez Perelman, Marzia Polito, Jean-Yves Bouguet, J...
140
Voted
FCCM
2002
IEEE
171views VLSI» more  FCCM 2002»
15 years 7 months ago
Coarse-Grain Pipelining on Multiple FPGA Architectures
Reconfigurable systems, and in particular, FPGA-based custom computing machines, offer a unique opportunity to define application-specific architectures. These architectures offer...
Heidi E. Ziegler, Byoungro So, Mary W. Hall, Pedro...
114
Voted
TCS
2008
15 years 2 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman