Sciweavers

11345 search results - page 26 / 2269
» Foundations of Computer Science
Sort
View
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
13 years 11 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 9 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
13 years 9 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
CCS
2008
ACM
13 years 9 months ago
SNAPP: stateless network-authenticated path pinning
This paper examines a new building block for next-generation networks: SNAPP, or Stateless Network-Authenticated Path Pinning. SNAPP-enabled routers securely embed their routing d...
Bryan Parno, Adrian Perrig, Dave Andersen
LPNMR
2011
Springer
12 years 10 months ago
Logic, Probability and Computation: Foundations and Issues of Statistical Relational AI
Over the last 25 years there has been considerable body of research into combinations of predicate logic and probability forming what has become known as (perhaps misleadingly) sta...
David Poole