Sciweavers

5948 search results - page 1149 / 1190
» Computing Robust Counter-Strategies
Sort
View
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
15 years 10 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
POPL
2008
ACM
15 years 10 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
15 years 10 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
OSDI
2006
ACM
15 years 10 months ago
CRAMM: Virtual Memory Support for Garbage-Collected Applications
Existing virtual memory systems usually work well with applications written in C and C++, but they do not provide adequate support for garbage-collected applications. The performa...
Ting Yang, Emery D. Berger, Scott F. Kaplan, J. El...
EDBT
2002
ACM
125views Database» more  EDBT 2002»
15 years 10 months ago
Estimating Answer Sizes for XML Queries
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
« Prev « First page 1149 / 1190 Last » Next »