Sciweavers

3082 search results - page 53 / 617
» New Bounds for the Controller Problem
Sort
View
150
Voted
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 7 months ago
An efficient online auditing approach to limit private data disclosure
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
Haibing Lu, Yingjiu Li, Vijayalakshmi Atluri, Jaid...
EOR
2008
82views more  EOR 2008»
15 years 3 months ago
Solving the pallet loading problem
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxe...
Gustavo H. A. Martins, Robert F. Dell
128
Voted
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
16 years 1 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
IJON
1998
82views more  IJON 1998»
15 years 3 months ago
Solving arithmetic problems using feed-forward neural networks
We design new feed-forward multi-layered neural networks which perform di erent elementary arithmetic operations, such as bit shifting, addition of N p-bit numbers, and multiplica...
Leonardo Franco, Sergio A. Cannas
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 4 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano