2446 search results - page 393 / 490 » First Smart Spaces |
136
Voted
COCO
2010
Springer
15 years 7 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
130
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
145
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
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...
131
Voted
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
155
Voted
DSN
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper, we propose a novel technique to detect all dangling pointer uses at run-time that is efficient enough for production use in server codes. One idea (previously used ...