Sciweavers

27354 search results - page 4872 / 5471
» Distributed And Parallel Computing
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 7 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
IEEESP
2007
98views more  IEEESP 2007»
15 years 7 months ago
Educating Students to Create Trustworthy Systems
igh level of abstraction and to provide broad oversight. In contrast, the goal of computer science security education is to provide the technicalexpertisetodevelopsecure software a...
Richard S. Swart, Robert F. Erbacher
PVLDB
2008
157views more  PVLDB 2008»
15 years 5 months ago
SEDA: a system for search, exploration, discovery, and analysis of XML Data
Keyword search in XML repositories is a powerful tool for interactive data exploration. Much work has recently been done on making XML search aware of relationship information emb...
Andrey Balmin, Latha S. Colby, Emiran Curtmola, Qu...
SAC
2010
ACM
15 years 5 months ago
The 'Dresden Image Database' for benchmarking digital image forensics
This paper introduces and documents a novel image database specifically built for the purpose of development and benchmarking of camera-based digital forensic techniques. More th...
Thomas Gloe, Rainer Böhme
SIAMSC
2011
142views more  SIAMSC 2011»
15 years 2 months ago
Efficiency Based Adaptive Local Refinement for First-Order System Least-Squares Formulations
Abstract. In this paper, we propose new adaptive local refinement (ALR) strategies for firstorder system least-squares (FOSLS) finite element in conjunction with algebraic multi...
J. H. Adler, Thomas A. Manteuffel, Stephen F. McCo...
« Prev « First page 4872 / 5471 Last » Next »