Sciweavers

16430 search results - page 3132 / 3286
» On Computable Tree Functions
Sort
View
CJTCS
1999
133views more  CJTCS 1999»
13 years 7 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
NAR
1998
122views more  NAR 1998»
13 years 7 months ago
The PIR-International Protein Sequence Database
The Protein Information Resource (PIR; http://wwwnbrf.georgetown.edu/pir/ ) supports research on molecular evolution, functional genomics, and computational biology by maintaining...
Winona C. Barker, John S. Garavelli, Daniel H. Haf...
SAC
2002
ACM
13 years 7 months ago
Semi-automatic design of agent organisations
Designing realistic multi-agent systems is a complex process, which involves specifying not only the functionality of individual agents, but also the authority relationships and l...
Anthony Karageorgos, Simon G. Thompson, Nikolay Me...
PAMI
2007
196views more  PAMI 2007»
13 years 7 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock
SAC
2008
ACM
13 years 7 months ago
Secure deletion for NAND flash file system
In most file systems, if a file is deleted, only the metadata of the file is deleted or modified and the file's data is still stored on the physical media. Some users require...
Jaeheung Lee, Junyoung Heo, Yookun Cho, Jiman Hong...
« Prev « First page 3132 / 3286 Last » Next »