Sciweavers

42 search results - page 6 / 9
» Transnational Digital Government Research: Project Highlight...
Sort
View
AI
2010
Springer
13 years 7 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
CCS
2007
ACM
14 years 1 months ago
Improving vulnerability discovery models
Security researchers are applying software reliability models to vulnerability data, in an attempt to model the vulnerability discovery process. I show that most current work on t...
Andy Ozment
SC
1995
ACM
13 years 11 months ago
Analysis of Multilevel Graph Partitioning
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
George Karypis, Vipin Kumar
IV
2008
IEEE
136views Visualization» more  IV 2008»
14 years 1 months ago
Visual Presentation Challenges for Mobile Spatial Applications: Three Case Studies
Using mobile devices for exploring and interacting with the user’s physical environment is among the most promising candidates for commercially successful future telecommunicati...
Peter Fröhlich, Matthias Baldauf, Peter Reich...
USENIX
1990
13 years 8 months ago
Efficient User-Level File Cache Management on the Sun Vnode Interface
In developing a distributed file system, there are several good reasons for implementing the client file cache manager as a user-level process. These include ease of implementatio...
David C. Steere, James J. Kistler, Mahadev Satyana...